000 | 03471nam a22005895i 4500 | ||
---|---|---|---|
001 | 978-3-540-36383-5 | ||
003 | DE-He213 | ||
005 | 20160624101934.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s2002 gw | s |||| 0|eng d | ||
020 |
_a9783540363835 _9978-3-540-36383-5 |
||
024 | 7 |
_a10.1007/3-540-36383-1 _2doi |
|
050 | 4 | _aQA75.5-76.95 | |
072 | 7 |
_aUY _2bicssc |
|
072 | 7 |
_aCOM014000 _2bisacsh |
|
082 | 0 | 4 |
_a004 _223 |
245 | 1 | 0 |
_aExperimental Algorithmics _h[electronic resource] : _bFrom Algorithm Design to Robust and Efficient Software / _cedited by Rudolf Fleischer, Bernard Moret, Erik Meineche Schmidt. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2002. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2002. |
|
300 |
_aXVIII, 286 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v2547 |
|
505 | 0 | _aAlgorithm 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 | _aComputer science. | |
650 | 0 | _aData structures (Computer science). | |
650 | 0 | _aComputer software. | |
650 | 0 | _aElectronic data processing. | |
650 | 0 | _aComputational complexity. | |
650 | 0 | _aAlgorithms. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aComputer Science, general. |
650 | 2 | 4 | _aData Structures. |
650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
650 | 2 | 4 | _aNumeric Computing. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aAlgorithms. |
700 | 1 |
_aFleischer, Rudolf. _eeditor. |
|
700 | 1 |
_aMoret, Bernard. _eeditor. |
|
700 | 1 |
_aSchmidt, Erik Meineche. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540003465 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v2547 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-36383-1 |
942 |
_2EBK4274 _cEBK |
||
999 |
_c33568 _d33568 |