Experimental Algorithms
Editat de Catherine C. McGeochen Limba Engleză Paperback – 8 mai 2008
Preț: 326.26 lei
Preț vechi: 407.83 lei
-20%
Puncte Express: 489
Carte tipărită la comandă
Livrare economică 22 iulie-05 august
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
Specificații
ISBN-13: 9783540685487
ISBN-10: 3540685480
Pagini: 380
Ilustrații: X, 363 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.58 kg
Ediția:2008
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540685480
Pagini: 380
Ilustrații: X, 363 p.
Dimensiuni: 155 x 235 x 21 mm
Greutate: 0.58 kg
Ediția:2008
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
Reducing Splaying by Taking Advantage of Working Sets.- Engineering Burstsort: Towards Fast In-Place String Sorting.- Comparing Integer Data Structures for 32 and 64 Bit Keys.- A New Graph-Theoretical Model for k-Dimensional Guillotine-Cutting Problems.- Layer-Free Upward Crossing Minimization.- On the Efficiency of a Local Iterative Algorithm to Compute Delaunay Realizations.- Computing Branch Decomposition of Large Planar Graphs.- Experimental Evaluation of an Exact Algorithm for the Orthogonal Art Gallery Problem.- Computing Multiple Watchman Routes.- Engineering Parallel In-Place Random Generation of Integer Permutations.- Parallel Partition Revisited.- Broadword Implementation of Rank/Select Queries.- Efficient Implementations of Heuristics for Routing and Wavelength Assignment.- Myopic Distributed Protocols for Singleton and Independent-Resource Congestion Games.- When to Reap and When to Sow – Lowering Peak Usage with Realistic Batteries.- Characterizing the Performance of Flash Memory Storage Devices and Its Impact on Algorithm Design.- Fast Local Search for the Maximum Independent Set Problem.- Optimal University Course Timetables and the Partial Transversal Polytope.- A Basic Toolbox for Constrained Quadratic 0/1 Optimization.- Empirical Investigation of Simplified Step-Size Control in Metaheuristics with a View to Theory.- Reconstructing Phylogenetic Networks with One Recombination.- Exact Algorithms for Cluster Editing: Evaluation and Experiments.- Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra’s Algorithm.- Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks.- Bidirectional A ??? Search for Time-Dependent Fast Paths.- Multi-criteria Shortest Paths in Time-Dependent Train Networks.