Experimental Algorithmics 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...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Fleischer, Rudolf (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Moret, Bernhard (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Meineche Schmidt, Erik (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2002.
Έκδοση:1st ed. 2002.
Σειρά:Lecture Notes in Computer Science, 2547
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 04063nam a2200601 4500
001 978-3-540-36383-5
003 DE-He213
005 20191028212309.0
007 cr nn 008mamaa
008 121227s2002 gw | s |||| 0|eng d
020 |a 9783540363835  |9 978-3-540-36383-5 
024 7 |a 10.1007/3-540-36383-1  |2 doi 
040 |d GrThAP 
050 4 |a QA75.5-76.95 
072 7 |a UY  |2 bicssc 
072 7 |a COM014000  |2 bisacsh 
072 7 |a UY  |2 thema 
082 0 4 |a 004  |2 23 
245 1 0 |a Experimental Algorithmics  |h [electronic resource] :  |b From Algorithm Design to Robust and Efficient Software /  |c edited by Rudolf Fleischer, Bernhard Moret, Erik Meineche Schmidt. 
250 |a 1st ed. 2002. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2002. 
300 |a XVIII, 286 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 2547 
505 0 |a 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. 
520 |a  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. 
650 0 |a Computer science. 
650 0 |a Data structures (Computer science). 
650 0 |a Algorithms. 
650 0 |a Numerical analysis. 
650 0 |a Computer science-Mathematics. 
650 1 4 |a Computer Science, general.  |0 http://scigraph.springernature.com/things/product-market-codes/I00001 
650 2 4 |a Data Structures.  |0 http://scigraph.springernature.com/things/product-market-codes/I15017 
650 2 4 |a Algorithm Analysis and Problem Complexity.  |0 http://scigraph.springernature.com/things/product-market-codes/I16021 
650 2 4 |a Numeric Computing.  |0 http://scigraph.springernature.com/things/product-market-codes/I1701X 
650 2 4 |a Discrete Mathematics in Computer Science.  |0 http://scigraph.springernature.com/things/product-market-codes/I17028 
650 2 4 |a Algorithms.  |0 http://scigraph.springernature.com/things/product-market-codes/M14018 
700 1 |a Fleischer, Rudolf.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Moret, Bernhard.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Meineche Schmidt, Erik.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783540003465 
776 0 8 |i Printed edition:  |z 9783662177303 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 2547 
856 4 0 |u https://doi.org/10.1007/3-540-36383-1  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
912 |a ZDB-2-BAE 
950 |a Computer Science (Springer-11645)