Proceedings of the Fifth Workshop on Algorithm Engineering and ExperimentsRichard E. Ladner SIAM, 01.01.2003 - 141 Seiten The ALENEX workshop provides a forum for the presentation of original research in the implementation and experimental evaluation of algorithms and data structures. This volume collects extended versions of the 12 papers that were selected for presentation. |
Häufige Begriffe und Wortgruppen
Adaptive radixsort approach approximation AT&T Labs bound bucket burstsort cache CGAL clustering constraints construction contains core-set corresponding cost cutting stock problem data structure dataset degree sequence Delaunay triangulations Dijkstra's algorithm distance distributions dynamic dynamic programming efficient elements equivalence class experiments facility fast Figure FUNET heuristic I/O-efficient I/Os implementation input insertion instance integer interpolation interval iterations knapsack MAE-WEST Markov chain memory method metric space MSD radixsort nodes number of edges optimal output packing paths algorithm PDP PBB pending performance persistent B-tree predicates prefix problem Proc programming query random graph ray-tracing recursive replacement paths requirements retrie retrie-GR rides rotation running sample schedule secs Section segments sets of strings shortest path shows solution solve sorting sorting algorithms spanners speedup static filter stdev subset Symposium t-Spanner threshold topology train unit type tree trie updates users vertex vertices