Cantitate/Preț
Produs

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

Editat de Rudolf Fleischer, Bernhard Moret, Erik Meineche Schmidt
en Limba Engleză Paperback – 13 dec 2002
 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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32670 lei

Preț vechi: 40837 lei
-20% Nou

Puncte Express: 490

Preț estimativ în valută:
6252 6577$ 5176£

Carte tipărită la comandă

Livrare economică 14-28 ianuarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540003465
ISBN-10: 3540003460
Pagini: 304
Ilustrații: XVIII, 286 p.
Dimensiuni: 155 x 235 x 16 mm
Greutate: 0.45 kg
Ediția:2002
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.

Caracteristici

Includes supplementary material: sn.pub/extras