Algorithm engineering and experimentation : third international workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001 : proceedings
Uloženo v:
| Korporativní autor: | |
|---|---|
| Další autoři: | , |
| Médium: | Livre numérique |
| Jazyk: | Anglais |
| Vydáno: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Edice: | Lecture notes in computer science
2153 |
| Témata: | |
| On-line přístup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Poznámka: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Algorithm engineering and experimentation, third international workshop, ALENEX 2001, WAshington, DC, USA, January 5-6, 2001, proceedings, Adam L. Buchsbaum, Jack Snoeyink (eds.), New York, Springer-Verlag, 2001, 1 vol. (VIII-229 p.), Lecture notes in computer science, 3-540-42560-8 • Algorithm Engineering and Experimentation, Texte imprimé, 9783662208526 |
Obsah:
- 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.