Theory and Practice of Algorithms in (Computer) Systems [electronic resource] : First International ICST Conference, TAPAS 2011, Rome, Italy, April 18-20, 2011, Proceedings / edited by Alberto Marchetti-Spaccamela, Michael Segal.
Contributor(s): Marchetti-Spaccamela, Alberto [editor.]
| Segal, Michael [editor.] | SpringerLink (Online service).
Material type: 
BookSeries: Theoretical Computer Science and General Issues: 6595Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2011Edition: 1st ed. 2011.Description: X, 266 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642197543.Subject(s): Algorithms | Machine theory | Software engineering | Computer simulation | Artificial intelligence -- Data processing | Numerical analysis | Algorithms | Formal Languages and Automata Theory | Software Engineering | Computer Modelling | Data Science | Numerical AnalysisAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 518.1 Online resources: Click here to access online
In:
Springer Nature eBookSummary: This book constitutes the refereed proceedings of the First International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems, TAPAS 2011, held in Rome, Italy, in April 2011. The 25 papers presented, including three short papers by invited speakers, were carefully reviewed and selected from 45 submissions. The papers all feature original research in the design, implementation and evaluation of algorithms with special focus on algorithms for combinatorial optimization problems, and to real-world applications, engineering and experimental analysis of algorithms - thus fostering the cooperation among researchers in computer science, networking, discrete mathematics, mathematical programming and operations research.
This book constitutes the refereed proceedings of the First International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems, TAPAS 2011, held in Rome, Italy, in April 2011. The 25 papers presented, including three short papers by invited speakers, were carefully reviewed and selected from 45 submissions. The papers all feature original research in the design, implementation and evaluation of algorithms with special focus on algorithms for combinatorial optimization problems, and to real-world applications, engineering and experimental analysis of algorithms - thus fostering the cooperation among researchers in computer science, networking, discrete mathematics, mathematical programming and operations research.
There are no comments for this item.