000 | 03859nam a22006015i 4500 | ||
---|---|---|---|
001 | 978-3-540-44688-0 | ||
003 | DE-He213 | ||
005 | 20160624101951.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s2001 gw | s |||| 0|eng d | ||
020 |
_a9783540446880 _9978-3-540-44688-0 |
||
024 | 7 |
_a10.1007/3-540-44688-5 _2doi |
|
050 | 4 | _aQA76.9.A43 | |
072 | 7 |
_aUMB _2bicssc |
|
072 | 7 |
_aCOM051300 _2bisacsh |
|
082 | 0 | 4 |
_a005.1 _223 |
245 | 1 | 0 |
_aAlgorithm Engineering _h[electronic resource] : _b5th International Workshop, WAE 2001 Århus, Denmark, August 28–31, 2001 Proceedings / _cedited by Gerth Stølting Brodal, Daniele Frigioni, Alberto Marchetti-Spaccamela. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2001. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c2001. |
|
300 |
_aX, 202 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 ; _v2141 |
|
505 | 0 | _aCompact DFA Representation for Fast Regular Expression Search -- The Max-Shift Algorithm for Approximate String Matching -- Fractal Matrix Multiplication: A Case Study on Portability of Cache Performance -- Experiences with the Design and Implementation of Space-Efficient Deques -- Designing and Implementing a General Purpose Halfedge Data Structure -- Optimised Predecessor Data Structures for Internal Memory -- An Adaptable and Extensible Geometry Kernel -- Efficient Resource Allocation with Noisy Functions -- Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem -- Exploiting Partial Knowledge of Satisfying Assignments -- Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture -- An Experimental Study of Data Migration Algorithms -- An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks -- Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry -- Pareto Shortest Paths is Often Feasible in Practice. | |
520 | _aThis book constitutes the refereed proceedings of the 5th Workshop on Algorithm Engineering, WAE 2001, held in Aarhus, Denmark, in August 2001. The 15 revised full papers presented were carefully reviewed and selected from 25 submissions. Among the topics addressed are implementation, experimental testing, and fine-tuning of discrete algorithms; novel use of discrete algorithms in other disciplines; empirical research on algorithms and data structures; and methodological issues regarding the process of converting user requirements into efficient algorithmic solutions and implemenations. | ||
650 | 0 | _aComputer science. | |
650 | 0 | _aComputer Communication Networks. | |
650 | 0 | _aData structures (Computer science). | |
650 | 0 | _aComputer software. | |
650 | 0 | _aElectronic data processing. | |
650 | 0 | _aComputational complexity. | |
650 | 0 | _aCombinatorics. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aAlgorithm Analysis and Problem Complexity. |
650 | 2 | 4 | _aDiscrete Mathematics in Computer Science. |
650 | 2 | 4 | _aData Structures. |
650 | 2 | 4 | _aComputer Communication Networks. |
650 | 2 | 4 | _aCombinatorics. |
650 | 2 | 4 | _aNumeric Computing. |
700 | 1 |
_aBrodal, Gerth Stølting. _eeditor. |
|
700 | 1 |
_aFrigioni, Daniele. _eeditor. |
|
700 | 1 |
_aMarchetti-Spaccamela, Alberto. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540425007 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v2141 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-44688-5 |
942 |
_2EBK4963 _cEBK |
||
999 |
_c34257 _d34257 |