UID:
almahu_9947920427302882
Format:
XVIII, 286 p.
,
online resource.
ISBN:
9783540363835
Series Statement:
Lecture Notes in Computer Science, 2547
Content:
Experimental algorithmics, as its name indicates, combines algorithmic work and experimentation: algorithms are not just designed, but also implemented and tested on a variety of instances. Perhaps the most important lesson in this process is that designing an algorithm is but the first step in the process of developing robust and efficient software for applications. Based on a seminar held at Dagstuhl Castle, Germany in September 2000, this state-of-the-art survey presents a coherent survey of the work done in the area so far. The 11 carefully reviewed chapters provide complete coverage of all current topics in experimental algorithmics.
Note:
Algorithm Engineering for Parallel Computation -- Visualization in Algorithm Engineering: Tools and Techniques -- Parameterized Complexity: The Main Ideas and Connections to Practical Computing -- A Comparison of Cache Aware and Cache Oblivious Static Search Trees Using Program Instrumentation -- Using Finite Experiments to Study Asymptotic Performance -- WWW.BDD-Portal.ORG: An Experimentation Platform for Binary Decision Diagram Algorithms -- Algorithms and Heuristics in VLSI Design -- Reconstructing Optimal Phylogenetic Trees: A Challenge in Experimental Algorithmics -- Presenting Data from Experiments in Algorithmics -- Distributed Algorithm Engineering -- Implementations and Experimental Studies of Dynamic Graph Algorithms.
In:
Springer eBooks
Additional Edition:
Printed edition: ISBN 9783540003465
Language:
English
DOI:
10.1007/3-540-36383-1
URL:
http://dx.doi.org/10.1007/3-540-36383-1
