Algorithm engineering and experimentation : international workshop ALENEX '99, Baltimore, MD, USA, January 15-16, 1999 : selected papers
Symmetric multiprocessors (SMPs) dominate the high-end server market and are currently the primary candidate for constructing large scale multiprocessor systems. Yet, the design of e cient parallel algorithms for this platform c- rently poses several challenges. The reason for this is that the rapid...
Gespeichert in:
| Körperschaft: | |
|---|---|
| Weitere Verfasser: | , |
| Format: | Livre numérique |
| Sprache: | Anglais |
| Veröffentlicht: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Schriftenreihe: | Lecture notes in computer science
1619 |
| Schlagworte: | |
| Online Zugang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Anmerkung: |
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, international workshop ALENEX '99, Baltimore, MD, USA, January 15-16, 1999, selected papers, Michael T. Goodrich, Catherine C. McGeoch (eds.), 1999, Berlin, Springer, 1 vol. (VIII-347 p.), Lecture notes in computer science, 3-540-66227-8 • Algorithm Engineering and Experimentation, Texte imprimé, 9783662166796 |
Inhaltsangabe:
- Combinatorial Algorithms
- Efficient Implementation of the WARM-UP Algorithm for the Construction of Length-Restricted Prefix Codes
- Implementing Weighted b-Matching Algorithms: Insights from a Computational Study
- Designing Practical Efficient Algorithms for Symmetric Multiprocessors
- Circular Drawings of Biconnected Graphs
- Heuristics and Experimental Design for Bigraph Crossing Number Minimization
- Binary Space Parititions in Plücker Space
- Practical Point-in-Polygon Tests Using CSG Representations of Polygons
- Software and Applications
- Accessing the Internal Organization of Data Structures in the JDSL Library
- Object-Oriented Design of Graph Oriented Data Structures
- A Case Study on the Cost of Geometric Computing
- Design and Implementation of the Fiduccia-Mattheyses Heuristic for VLSI Netlist Partitioning
- Algorithms for Restoration Planning in a Telecommunications Network
- Computing the n . m Shortest Paths Efficiently
- Image Watermarking for Copyright Protection
- Algorithms for NP-Hard Problems
- A Self Organizing Bin Packing Heuristic
- Finding the Right Cutting Planes for the TSP
- Obstacle-Avoiding Euclidean Steiner Trees in the Plane: An Exact Algorithm
- Data Structures
- Adaptive Algorithms for Cache-efficient Trie Search
- Fast Priority Queues for Cached Memory
- Efficient Bulk Operations on Dynamic R-trees.