Vai al contenuto principale della pagina

Algorithm Engineering and Experimentation [[electronic resource] ] : Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001. Revised Papers / / edited by Adam L. Buchsbaum, Jack Snoeyink



(Visualizza in formato marc)    (Visualizza in BIBFRAME)

Titolo: Algorithm Engineering and Experimentation [[electronic resource] ] : Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001. Revised Papers / / edited by Adam L. Buchsbaum, Jack Snoeyink Visualizza cluster
Pubblicazione: Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2001
Edizione: 1st ed. 2001.
Descrizione fisica: 1 online resource (VIII, 236 p.)
Disciplina: 005.1
Soggetto topico: Computer programming
Database management
Algorithms
Data structures (Computer science)
Computer graphics
Numerical analysis
Programming Techniques
Database Management
Algorithm Analysis and Problem Complexity
Data Structures
Computer Graphics
Numeric Computing
Persona (resp. second.): BuchsbaumAdam L
SnoeyinkJack
Note generali: Bibliographic Level Mode of Issuance: Monograph
Nota di bibliografia: Includes bibliographical references and index.
Nota di contenuto: 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.
Titolo autorizzato: Algorithm Engineering and Experimentation  Visualizza cluster
ISBN: 3-540-44808-X
Formato: Materiale a stampa
Livello bibliografico Monografia
Lingua di pubblicazione: Inglese
Record Nr.: 996465876603316
Lo trovi qui: Univ. di Salerno
Opac: Controlla la disponibilità qui
Serie: Lecture Notes in Computer Science, . 0302-9743 ; ; 2153