Algorithm Engineering: 4th International Workshop, WAE 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings: Lecture Notes in Computer Science, cartea 1982
Editat de Stefan Näher, Dorothea Wagneren Limba Engleză Paperback – 15 aug 2001
Din seria Lecture Notes in Computer Science
- 20% Preț: 1061.55 lei
- 20% Preț: 341.95 lei
- 20% Preț: 369.12 lei
- 20% Preț: 645.28 lei
- 20% Preț: 591.51 lei
- 15% Preț: 580.46 lei
- Preț: 410.88 lei
- 20% Preț: 504.57 lei
- Preț: 381.21 lei
- 20% Preț: 340.32 lei
- 20% Preț: 1414.79 lei
- 20% Preț: 538.29 lei
- 20% Preț: 583.40 lei
- 20% Preț: 1075.26 lei
- 20% Preț: 238.01 lei
- 17% Preț: 360.19 lei
- 20% Preț: 438.69 lei
- 20% Preț: 1183.14 lei
- 20% Preț: 596.46 lei
- 15% Preț: 438.59 lei
- 20% Preț: 655.02 lei
- 20% Preț: 649.49 lei
- 20% Preț: 309.90 lei
- 20% Preț: 337.00 lei
- Preț: 449.57 lei
- 20% Preț: 310.26 lei
- 20% Preț: 1024.44 lei
- 20% Preț: 579.30 lei
- 20% Preț: 763.23 lei
- 20% Preț: 453.32 lei
- 20% Preț: 575.48 lei
- 20% Preț: 585.88 lei
- 20% Preț: 326.98 lei
- 20% Preț: 825.93 lei
- 17% Preț: 427.22 lei
- 20% Preț: 763.23 lei
- 20% Preț: 350.21 lei
- 20% Preț: 307.71 lei
- 20% Preț: 580.93 lei
- 20% Preț: 340.32 lei
- 20% Preț: 343.62 lei
- 20% Preț: 583.40 lei
- 20% Preț: 583.40 lei
- Preț: 389.48 lei
- 20% Preț: 353.50 lei
- 20% Preț: 607.39 lei
Preț: 330.42 lei
Preț vechi: 413.03 lei
-20% Nou
Puncte Express: 496
Preț estimativ în valută:
63.24€ • 65.77$ • 52.100£
63.24€ • 65.77$ • 52.100£
Carte tipărită la comandă
Livrare economică 13-27 martie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783540425120
ISBN-10: 3540425128
Pagini: 256
Ilustrații: VIII, 246 p.
Dimensiuni: 155 x 235 x 13 mm
Greutate: 0.36 kg
Ediția:2001
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seria Lecture Notes in Computer Science
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540425128
Pagini: 256
Ilustrații: VIII, 246 p.
Dimensiuni: 155 x 235 x 13 mm
Greutate: 0.36 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ă
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