Hugendubel.info - Die B2B Online-Buchhandlung 

Merkliste
Die Merkliste ist leer.
Bitte warten - die Druckansicht der Seite wird vorbereitet.
Der Druckdialog öffnet sich, sobald die Seite vollständig geladen wurde.
Sollte die Druckvorschau unvollständig sein, bitte schliessen und "Erneut drucken" wählen.

Algorithm Engineering

4th International Workshop, WAE 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings
BuchKartoniert, Paperback
246 Seiten
Englisch
Springererschienen am15.08.2001
This volume contains the papers accepted for the 4th Workshop on Algorithm Engineering (WAE 2000) held in Saarbruc ¨ ken, Germany, during 5-8 September 2000, together with the abstract of the invited lecture given by Karsten Weihe.mehr
Verfügbare Formate
BuchKartoniert, Paperback
EUR53,49
E-BookPDF1 - PDF WatermarkE-Book
EUR53,49

Produkt

KlappentextThis volume contains the papers accepted for the 4th Workshop on Algorithm Engineering (WAE 2000) held in Saarbruc ¨ ken, Germany, during 5-8 September 2000, together with the abstract of the invited lecture given by Karsten Weihe.
Details
ISBN/GTIN978-3-540-42512-0
ProduktartBuch
EinbandartKartoniert, Paperback
Verlag
Erscheinungsjahr2001
Erscheinungsdatum15.08.2001
ReiheLecture Notes in Computer Science
Seiten246 Seiten
SpracheEnglisch
Gewicht363 g
IllustrationenVIII, 246 p.
Artikel-Nr.10516083

Inhalt/Kritik

Inhaltsverzeichnis
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.mehr

Schlagworte