Matches in Harvard for { <http://id.lib.harvard.edu/aleph/009103415/catalog> ?p ?o. }
Showing items 1 to 32 of
32
with 100 items per page.
- catalog abstract "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.".
- catalog contributor b12819526.
- catalog contributor b12819527.
- catalog contributor b12819528.
- catalog created "c2002.".
- catalog date "2002".
- catalog date "c2002.".
- catalog dateCopyrighted "c2002.".
- catalog description "Algorithm engineering for parallel computation / David A. Bader, Bernard M.E. Moret, and Peter Sanders -- Visualization in algorithm engineering / Camil Demetrescu [and others] -- Parameterized complexity / Michael R. Fellows -- Comparison of cache aware and cache oblivious static search trees using program instrumentation / Richard E. Ladner, Ray Fortna, and Bao-Hoang Nguyen -- Using finite experiments to study asymptotic perforamnce / Catherine McGeoch [and others] -- WWW.BDD-Portal.ORG / Christoph Meinel, Harald Sack, and Arno Wagner -- Algorithms and heuristics in VLSI design / Christoph Meinel and Christian Stangier -- Reconstructing optimal phylogenetic trees / Bernard M.E. Moret and Tandy Warnow -- Presenting data from experiments in algorithms / Peter Sanders -- Distributed algorithm engineering / Paul G. Spirakis and Christos D. Zaroliagis -- Implementations and experimental studies of dynamic graph algorithms / Christos D. Zaroliagis.".
- catalog description "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.".
- catalog description "Includes bibliographical references and index.".
- catalog extent "xvii, 278 p. :".
- catalog identifier "3540003460 (softcover : alk. paper)".
- catalog isPartOf "Lecture notes in computer science ; 2547".
- catalog issued "2002".
- catalog issued "c2002.".
- catalog language "eng".
- catalog publisher "Berlin ; New York : Springer,".
- catalog subject "005.1 21".
- catalog subject "Algorithms.".
- catalog subject "Application software Development.".
- catalog subject "Computational complexity.".
- catalog subject "Computer algorithms.".
- catalog subject "Computer science.".
- catalog subject "Computer software.".
- catalog subject "Data structures (Computer science)".
- catalog subject "Electronic data processing.".
- catalog subject "QA76.9.A43 E97 2000".
- catalog tableOfContents "Algorithm engineering for parallel computation / David A. Bader, Bernard M.E. Moret, and Peter Sanders -- Visualization in algorithm engineering / Camil Demetrescu [and others] -- Parameterized complexity / Michael R. Fellows -- Comparison of cache aware and cache oblivious static search trees using program instrumentation / Richard E. Ladner, Ray Fortna, and Bao-Hoang Nguyen -- Using finite experiments to study asymptotic perforamnce / Catherine McGeoch [and others] -- WWW.BDD-Portal.ORG / Christoph Meinel, Harald Sack, and Arno Wagner -- Algorithms and heuristics in VLSI design / Christoph Meinel and Christian Stangier -- Reconstructing optimal phylogenetic trees / Bernard M.E. Moret and Tandy Warnow -- Presenting data from experiments in algorithms / Peter Sanders -- Distributed algorithm engineering / Paul G. Spirakis and Christos D. Zaroliagis -- Implementations and experimental studies of dynamic graph algorithms / Christos D. Zaroliagis.".
- catalog title "Experimental algorithmics : from algorithm design to robust and efficient software / Rudolf Fleischer, Bernard Moret, Erik Meineche Schmidt (eds.).".
- catalog type "Dagstuhl (2000) swd".
- catalog type "text".