My Account Log in

1 option

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

LIBRA Q341 .P7 2004
Loading location information...

Available from offsite location This item is stored in our repository but can be checked out.

Log in to request item
Format:
Book
Contributor:
Buchsbaum, Adam L., editor.
Snoeyink, Jack, editor.
SpringerLink (Online service)
Series:
Computer Science (Springer-11645)
Lecture notes in computer science 0302-9743 ; 2153.
Lecture Notes in Computer Science, 0302-9743 ; 2153
Language:
English
Subjects (All):
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.
Local Subjects:
Programming Techniques.
Database Management.
Algorithm Analysis and Problem Complexity.
Data Structures.
Computer Graphics.
Numeric Computing.
Physical Description:
1 online resource (VIII, 236 pages).
Edition:
First edition 2001.
Contained In:
Springer eBooks
Place of Publication:
Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2001.
System Details:
text file PDF
Contents:
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.
Other Format:
Printed edition:
ISBN:
978-3-540-44808-2
9783540448082
Access Restriction:
Restricted for use by site license.

The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.

We want your feedback!

Thanks for using the Penn Libraries new search tool. We encourage you to submit feedback as we continue to improve the site.

My Account

Shelf Request an item Bookmarks Fines and fees Settings

Guides

Using the Library Catalog Using Articles+ Library Account