Experimental Algorithmics [electronic resource] : From Algorithm Design to Robust and Efficient Software /

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.

Saved in:
Bibliographic Details
Main Authors: Fleischer, Rudolf. editor., Moret, Bernard. editor., Schmidt, Erik Meineche. editor., SpringerLink (Online service)
Format: Texto biblioteca
Language:eng
Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 2002
Subjects:Computer science., Data structures (Computer science)., Algorithms., Numerical analysis., Computer science, Computer Science., Computer Science, general., Data Structures., Algorithm Analysis and Problem Complexity., Numeric Computing., Discrete Mathematics in Computer Science.,
Online Access:http://dx.doi.org/10.1007/3-540-36383-1
Tags: Add Tag
No Tags, Be the first to tag this record!