1 option
Algorithm Engineering : 4th International Workshop, WAE 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings / edited by Stefan Näher, Dorothea Wagner.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 1982.
- Lecture Notes in Computer Science, 0302-9743 ; 1982
- Language:
- English
- Subjects (All):
- Computer programming.
- Computers.
- Algorithms.
- Numerical analysis.
- Data structures (Computer science).
- Computer networks.
- Programming Techniques.
- Theory of Computation.
- Algorithm Analysis and Problem Complexity.
- Numeric Computing.
- Data Structures.
- Computer Communication Networks.
- Local Subjects:
- Programming Techniques.
- Theory of Computation.
- Algorithm Analysis and Problem Complexity.
- Numeric Computing.
- Data Structures.
- Computer Communication Networks.
- Physical Description:
- 1 online resource (VIII, 246 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
- Summary:
- This volume contains the papers accepted for the 4th Workshop on Algorithm Engineering (WAE 2000) held in Saarbruc ̈ ken, Germany, during 5-8 September 2000, together with the abstract of the invited lecture given by Karsten Weihe. The Workshop on Algorithm Engineering covers research on all aspects of the subject. The goal is to present recent research results and to identify and explore directions for future research. Previous meetings were held in Venice (1997), Saarbruc ̈ ken (1998), and London (1999). Papers were solicited describing original research in all aspects of algorithm engineering, including: - Development of software repositories and platforms which allow the use of and experimentation with e?cient discrete algorithms. - Novel uses of discrete algorithms in other disciplines and the evaluation of algorithms for realistic environments. - Methodological issues including standards in the context of empirical - search on algorithms and data structures. - Methodological issues regarding the process of converting user requirements into e?cient algorithmic solutions and implementations. The program committee accepted 16 from a total of 30 submissions. The program committee meeting was conducted electronically. The criteria for sel- tion were originality, quality, and relevance to the subject area of the workshop. Considerable e?ort was devoted to the evaluation of the submissions and to p- viding the authors with feedback. Each submission was reviewed by at least four program committee members (assisted by subreferees). A special issue of the ACM Journal of Experimental Algorithmics will be devoted to selected papers from WAE 2000.
- Contents:
- Invited Lectures
- On the Differences between "Practical" and "Applied"
- Contributed Papers
- An Experimental Study of Online Scheduling Algorithms
- Implementation of O(nmlog n) Weighted Matchings in General Graphs. The Power of Data Structures
- Pushing the Limits in Sequential Sorting
- Efficient Sorting Using Registers and Caches
- Lattice Basis Reduction with Dynamic Approximation
- Clustering Data without Prior Knowledge
- Recognizing Bundles in Time Table Graphs - A Structural Approach
- Analysis and Experimental Evaluation of an Innovative and Efficient Routing Protocol for Ad-hoc Mobile Networks
- Portable List Ranking: An Experimental Study
- Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM
- Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms
- Visualizing Algorithms Over the Web with the Publication-Driven Approach
- Interchanging Tw Segments of an Array in a Hierarchical Memory System
- Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves
- Planar Point Location for Large Data Sets: To Seek or Not to Seek
- Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees
- Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees
- Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study
- New Algorithms for Examination Timetabling.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-44691-0
- 9783540446910
- 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.