Algorithm Engineering
Editat de Gerd Stoelting Brodal, Daniele Frigioni, Alberto Marchetti-Spaccamelaen Limba Engleză Paperback – 15 aug 2001
Preț: 317.66 lei
Preț vechi: 397.08 lei
-20%
Puncte Express: 476
Preț estimativ în valută:
56.17€ • 64.41$ • 48.55£
56.17€ • 64.41$ • 48.55£
Carte tipărită la comandă
Livrare economică 27 aprilie-11 mai
Specificații
ISBN-13: 9783540425007
ISBN-10: 3540425004
Pagini: 212
Ilustrații: X, 202 p.
Dimensiuni: 155 x 235 x 12 mm
Greutate: 0.33 kg
Ediția:2001
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540425004
Pagini: 212
Ilustrații: X, 202 p.
Dimensiuni: 155 x 235 x 12 mm
Greutate: 0.33 kg
Ediția:2001
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
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