Notice bibliographique
- Notice
Type(s) de contenu et mode(s) de consultation : Texte noté : électronique
Auteur(s) : ALENEX 2002 (2002 ; San Francisco, Calif.)
Stein, Clifford (1965-....)
Titre(s) : Algorithm engineering and experiments [Texte électronique] : 4th international workshop, ALENEX 2002, San Francisco, CA, USA, January 4-5. 2002 : revised papers / David Mount, Clifford Stein (eds.)
Publication : Berlin : Springer, 2002
Description matérielle : 1 online resource (viii, 205 pages)
Collection : Lecture notes in computer science ; 2409
Note(s) : Includes bibliographical references and index
This book constitutes the thoroughly refereed post-proceedings of the 4th International
Workshop on Algorithm Engineering and Experiments, ALENEX 2002, held in San Francisico,
CA, USA in January 2002. The 15 revised full papers presented were carefully reviewed
and selected from 34 submissions. Among the topics addressed are hewistics for algorithms,
combinatorial optimization, searching, graph computation, network optimization, scheduling,
computational geometry, sorting, and clustering algorithms
Autre(s) auteur(s) : Mount, David M.. Fonction indéterminée
Sujet(s) : Informatique
Algorithmes
Analyse numérique
Structures de données (informatique)
Indice(s) Dewey :
005.1 (23e éd.) = Développement de logiciels
Identifiants, prix et caractéristiques : ISBN 9783540456438
Identifiant de la notice : ark:/12148/cb44690890x
Notice n° :
FRBNF44690890
(notice reprise d'un réservoir extérieur)
Table des matières : ALENEX 2002 ; On the Implementation of MST-Based Heuristics for the Steiner Problem
in Graphs ; A Time-Sensitive System for Black-Box Combinatorial Optimization ; A
Compressed Breadth-First Search for Satisfiability ; Using Multi-level Graphs for
Timetable Information in Railway Systems ; Evaluating the Local Ratio Algorithm for
Dynamic Storage Allocation ; An Experimental Study of Prefetching and Caching Algorithms
for the World Wide Web ; The Treewidth of Java Programs ; Partitioning Planar Graphs
with Costs and Weights ; Maintaining Dynamic Minimum Spanning Trees: An Experimental
Study ; Experimental Evaluation of a New Shortest Path Algorithm ; Getting More
from Out-of-Core Columnsort ; Topological Sweep in Degenerate Cases ; Acceleration
of K-Means and Related Clustering Algorithms ; STAR-Tree: An Efficient Self-Adjusting
Index for Moving Objects ; An Improvement on Tree Selection Sort.
