Algorithm Engineering and Experimentation [electronic resource] : Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001. Revised Papers /
Material type: TextSeries: Lecture Notes in Computer Science ; 2153Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001Edition: 1st ed. 2001Description: VIII, 236 p. online resourceContent type:- text
- computer
- online resource
- 9783540448082
- 005.11 23
- QA76.6-76.66
ALENEX’01 -- Solving a “Hard” Problem to Approximate an “Easy” One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems -- CNOP - A Package for Constrained Network Optimization -- The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests -- Network Tomography through End-to-End Measurements -- Experimental Results on Statistical Approaches to Page Replacement Policies -- Estimating Resemblance of MIDI Documents -- Experiments on Adaptive Set Intersections for Text Retrieval Systems -- PVD: A Stable Implementation for Computing Voronoi Diagrams of Polygonal Pockets -- Hierarchical Clustering of Trees: Algorithms and Experiments -- Travel Planning with Self-Made Maps -- New Algorithmic Challenges Arising in Measurement-Driven Networking Research -- A Probabilistic Spell for the Curse of Dimensionality -- Experimental Evaluation of the Height of a Random Set of Points in a d-Dimensional Cube -- An Empirical Study of a New Approach to Nearest Neighbor Searching -- Spectral Analysis for Data Mining -- Trade Off Between Compression and Search Times in Compact Suffix Array -- Implementation of a PTAS for Scheduling with Release Dates -- Biased Skip Lists for Highly Skewed Access Patterns.
There are no comments on this title.