Algorithm engineering and experimentation : third international workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001 : proceedings
Enregistré dans:
| Collectivité auteur: | |
|---|---|
| Autres auteurs: | , |
| Format: | Livre numérique |
| Langue: | Anglais |
| Publié: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Collection: | Lecture notes in computer science
2153 |
| Sujets: | |
| Accès en ligne: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Note: |
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 |
| LEADER | 03789nam a22004097a 4500 | ||
|---|---|---|---|
| 001 | 969411 | ||
| 008 | 110927q2000 xxe ||| |||| 00| 0 eng d | ||
| 009 | PPN155173057 | ||
| 020 | |a 9783540448082 (PDF) | ||
| 041 | 0 | |a eng | |
| 082 | |a 004 | ||
| 111 | 2 | |a International Workshop on Algorithm engineering and experimentation |n (03 |d :2001 |c :Washington). | |
| 245 | 1 | 0 | |a Algorithm engineering and experimentation : |b third international workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001 : proceedings |c [edited by] Adam L. Buchsbaum, Jack Snoeyink. |
| 260 | |a Berlin [etc.] : |b Springer. | ||
| 260 | |a Cham : |b Springer Nature, |c [20..]. | ||
| 490 | 0 | |a Lecture notes in computer science |v 2153 |x 1611-3349 | |
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 500 | |a Archives Springer e-books (Licence nationale) | ||
| 505 | 0 | |a 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. | |
| 506 | |a Accès en ligne pour les établissements français bénéficiaires des licences nationales | ||
| 506 | |a Accès soumis à abonnement pour tout autre établissement | ||
| 506 | |a Conditions particulières de réutilisation pour les bénéficiaires des licences nationales. https://www.licencesnationales.fr/springer-nature-ebooks-contrat-licence-ln-2017 | ||
| 650 | |a Informatique | ||
| 650 | |a Algorithmes | ||
| 650 | |a Analyse numérique | ||
| 650 | |a Analyse combinatoire | ||
| 650 | |a Structures de données (informatique) | ||
| 650 | |a Actes de congrès | ||
| 700 | 1 | |a Buchsbaum, Adam L., |d 19..- |4 pbd | |
| 700 | 1 | |a Snoeyink, Jack, |d 19..- |4 pbd | |
| 776 | 0 | |0 058899219 |t Algorithm engineering and experimentation |o third international workshop, ALENEX 2001, WAshington, DC, USA, January 5-6, 2001 |o proceedings |f Adam L. Buchsbaum, Jack Snoeyink (eds.) |c New York |n Springer-Verlag |d 2001 |p 1 vol. (VIII-229 p.) |s Lecture notes in computer science |z 3-540-42560-8 | |
| 776 | 0 | |t Algorithm Engineering and Experimentation |b Texte imprimé |z 9783662208526 | |
| 856 | 4 | |q PDF |u https://doi.org/10.1007/3-540-44808-X |z Accès sur la plateforme de l'éditeur | |
| 856 | 4 | |u https://revue-sommaire.istex.fr/ark:/67375/8Q1-QLNDH0VZ-F |z Accès sur la plateforme Istex | |
| 856 | 4 | |5 452349901:750674377 |u https://ezproxy.univ-orleans.fr/login?url=https://doi.org/10.1007/3-540-44808-X |z Accès Université d'Orléans | |
| 856 | 4 | |5 180339901:754022870 |u https://ezproxy.insa-cvl.fr/login?qurl=https://doi.org/10.1007/3-540-44808-X |z Accès INSA CVL | |
| 997 | |0 969411 |1 Livre numérique |a Ressource numérique |b INSA |b ENSA |c 0/Bibliothèque numérique/ |c 1/Bibliothèque numérique/Autre ressource numérique/ | ||