, ,

Algorithm Engineering

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

Specificaties
Paperback, 202 blz. | Engels
Springer Berlin Heidelberg | 2001e druk, 2001
ISBN13: 9783540425007
Rubricering
Springer Berlin Heidelberg 2001e druk, 2001 9783540425007
Onderdeel van serie Lecture Notes in Computer Science
Verwachte levertijd ongeveer 9 werkdagen

Samenvatting

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

Specificaties

ISBN13:9783540425007
Taal:Engels
Bindwijze:paperback
Aantal pagina's:202
Uitgever:Springer Berlin Heidelberg
Druk:2001

Inhoudsopgave

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.

Rubrieken

Populaire producten

    Personen

      Trefwoorden

        Algorithm Engineering