Algorithm Engineering
Editat de Stefan Näher, Dorothea Wagneren Limba Engleză Paperback – 15 aug 2001
Preț: 319.92 lei
Preț vechi: 399.90 lei
-20%
Puncte Express: 480
Preț estimativ în valută:
56.53€ • 65.16$ • 49.35£
56.53€ • 65.16$ • 49.35£
Carte tipărită la comandă
Livrare economică 16-30 mai
Specificații
ISBN-13: 9783540425120
ISBN-10: 3540425128
Pagini: 256
Ilustrații: VIII, 246 p.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.39 kg
Ediția:2001
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540425128
Pagini: 256
Ilustrații: VIII, 246 p.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.39 kg
Ediția:2001
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Invited Lectures.- On the Differences between “Practical” and “Applied”.- Contributed Papers.- An Experimental Study of Online Scheduling Algorithms.- Implementation of O(nmlog n) Weighted Matchings in General Graphs. The Power of Data Structures.- Pushing the Limits in Sequential Sorting.- Efficient Sorting Using Registers and Caches.- Lattice Basis Reduction with Dynamic Approximation.- Clustering Data without Prior Knowledge.- Recognizing Bundles in Time Table Graphs - A Structural Approach.- Analysis and Experimental Evaluation of an Innovative and Efficient Routing Protocol for Ad-hoc Mobile Networks.- Portable List Ranking: An Experimental Study.- Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM.- Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms.- Visualizing Algorithms Over the Web with the Publication-Driven Approach.- Interchanging Tw Segments of an Array in a Hierarchical Memory System.- Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves.- Planar Point Location for Large Data Sets: To Seek or Not to Seek.- Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees.- Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees.- Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study.- New Algorithms for Examination Timetabling.
Caracteristici
Includes supplementary material: sn.pub/extras