Cantitate/Preț
Produs

Algorithm Engineering: 5th International Workshop, WAE 2001 Aarhus, Denmark, August 28-31, 2001 Proceedings: Lecture Notes in Computer Science, cartea 2141

Editat de Gerd Stoelting Brodal, Daniele Frigioni, Alberto Marchetti-Spaccamela
en Limba Engleză Paperback – 15 aug 2001
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32842 lei

Preț vechi: 41053 lei
-20% Nou

Puncte Express: 493

Preț estimativ în valută:
6285 6553$ 5223£

Carte tipărită la comandă

Livrare economică 20 martie-03 aprilie

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783540425007
ISBN-10: 3540425004
Pagini: 212
Ilustrații: X, 202 p.
Dimensiuni: 155 x 233 x 11 mm
Greutate: 0.31 kg
Ediția:2001
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.

Caracteristici

Includes supplementary material: sn.pub/extras