Experimental Algorithmics: From Algorithm Design to Robust and Efficient Software: 2547 (Lecture Notes in Computer Science, 2547)

ISBN 10: 3540003460 / ISBN 13: 9783540003465

Edité par Springer, 2002

A propos de cet article

Most items will be dispatched the same or the next working day. A copy that has been read but remains in clean condition. All of the pages are intact and the cover is intact and the spine may show signs of wear. The book may have minor markings which are not specifically mentioned.

N° de réf. du vendeur wbb0025110938

Détails bibliographiques

• Titre: Experimental Algorithmics: From Algorithm Design to Robust and Efficient Software: 2547 (Lecture Notes in Computer Science, 2547)
• Éditeur: Springer
• Date de parution: 2002
• Langue: anglais
• ISBN à 10 chiffres: 3540003460
• ISBN à 13 chiffres: 9783540003465
• Reliure: Couverture souple
• État de l'article: Good

A propos de ce titre

Synopsis

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.