Coverart for item
The Resource 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, (electronic resource)

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, (electronic resource)

Label
Algorithm Engineering and Experimentation : Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001. Revised Papers
Title
Algorithm Engineering and Experimentation
Title remainder
Third International Workshop, ALENEX 2001, Washington, DC, USA, January 5-6, 2001. Revised Papers
Statement of responsibility
edited by Adam L. Buchsbaum, Jack Snoeyink
Creator
Contributor
Editor
Editor
Subject
Language
  • eng
  • eng
Member of
Dewey number
005.11
http://bibfra.me/vocab/relation/httpidlocgovvocabularyrelatorsedt
  • k20H8651YNc
  • 0KK-OCtpE4M
Image bit depth
0
Language note
English
LC call number
QA76.6-76.66
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2001
http://bibfra.me/vocab/lite/meetingName
ALENEX 2001
Nature of contents
dictionaries
http://library.link/vocab/relatedWorkOrContributorName
  • Buchsbaum, Adam L.
  • Snoeyink, Jack.
Series statement
Lecture Notes in Computer Science,
Series volume
2153
http://library.link/vocab/subjectName
  • Computer science
  • Database management
  • Computer software
  • Data structures (Computer scienc
  • Computer graphics
  • Electronic data processing
  • Programming Techniques
  • Database Management
  • Algorithm Analysis and Problem Complexity
  • Data Structures
  • Computer Graphics
  • Numeric Computing
Label
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, (electronic resource)
Instantiates
Publication
Note
Bibliographic Level Mode of Issuance: Monograph
Antecedent source
mixed
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
cr
Color
not applicable
Content category
text
Content type code
txt
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
Dimensions
unknown
Edition
1st ed. 2001.
Extent
1 online resource (VIII, 236 p.)
File format
multiple file formats
Form of item
online
Isbn
9783540448082
Level of compression
uncompressed
Media category
computer
Media type code
c
Other control number
10.1007/3-540-44808-X
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (CKB)1000000000211632
  • (SSID)ssj0000321162
  • (PQKBManifestationID)11262212
  • (PQKBTitleCode)TC0000321162
  • (PQKBWorkID)10262691
  • (PQKB)10218497
  • (DE-He213)978-3-540-44808-2
  • (MiAaPQ)EBC3072006
  • (EXLCZ)991000000000211632
Label
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, (electronic resource)
Publication
Note
Bibliographic Level Mode of Issuance: Monograph
Antecedent source
mixed
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
cr
Color
not applicable
Content category
text
Content type code
txt
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
Dimensions
unknown
Edition
1st ed. 2001.
Extent
1 online resource (VIII, 236 p.)
File format
multiple file formats
Form of item
online
Isbn
9783540448082
Level of compression
uncompressed
Media category
computer
Media type code
c
Other control number
10.1007/3-540-44808-X
Quality assurance targets
absent
Reformatting quality
access
Specific material designation
remote
System control number
  • (CKB)1000000000211632
  • (SSID)ssj0000321162
  • (PQKBManifestationID)11262212
  • (PQKBTitleCode)TC0000321162
  • (PQKBWorkID)10262691
  • (PQKB)10218497
  • (DE-He213)978-3-540-44808-2
  • (MiAaPQ)EBC3072006
  • (EXLCZ)991000000000211632

Library Locations

  • Architecture LibraryBorrow it
    Gould Hall 830 Van Vleet Oval Rm. 105, Norman, OK, 73019, US
    35.205706 -97.445050
  • Bizzell Memorial LibraryBorrow it
    401 W. Brooks St., Norman, OK, 73019, US
    35.207487 -97.447906
  • Boorstin CollectionBorrow it
    401 W. Brooks St., Norman, OK, 73019, US
    35.207487 -97.447906
  • Chinese Literature Translation ArchiveBorrow it
    401 W. Brooks St., RM 414, Norman, OK, 73019, US
    35.207487 -97.447906
  • Engineering LibraryBorrow it
    Felgar Hall 865 Asp Avenue, Rm. 222, Norman, OK, 73019, US
    35.205706 -97.445050
  • Fine Arts LibraryBorrow it
    Catlett Music Center 500 West Boyd Street, Rm. 20, Norman, OK, 73019, US
    35.210371 -97.448244
  • Harry W. Bass Business History CollectionBorrow it
    401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • History of Science CollectionsBorrow it
    401 W. Brooks St., Rm. 521NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • John and Mary Nichols Rare Books and Special CollectionsBorrow it
    401 W. Brooks St., Rm. 509NW, Norman, OK, 73019, US
    35.207487 -97.447906
  • Library Service CenterBorrow it
    2601 Technology Place, Norman, OK, 73019, US
    35.185561 -97.398361
  • Price College Digital LibraryBorrow it
    Adams Hall 102 307 West Brooks St., Norman, OK, 73019, US
    35.210371 -97.448244
  • Western History CollectionsBorrow it
    Monnet Hall 630 Parrington Oval, Rm. 300, Norman, OK, 73019, US
    35.209584 -97.445414
Processing Feedback ...