Algorithm Engineering 5th International Workshop, WAE 2001 Aarhus, Denmark, August 28-31, 2001 Proceedings /

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Brodal, Gerd Stoelting (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Frigioni, Daniele (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Marchetti-Spaccamela, Alberto (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001.
• Έκδοση: 1st ed. 2001.
• Σειρά: Lecture Notes in Computer Science, 2141
• Θέματα: Computers.; Computer programming.; Data structures (Computer science).; Algorithms.; Computer science-Mathematics.; Theory of Computation.; Programming Techniques.; Data Structures and Information Theory.; Algorithm Analysis and Problem Complexity.; Discrete Mathematics in Computer Science.; Data Structures.

This 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 t...

Πίνακας περιεχομένων:

• Compact 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.