|  |
| |
| Artikel-Nr.:
858A-9783540439776 Herst.-Nr.:
9783540439776 EAN/GTIN:
9783540439776 |
| |
|
| | |
| 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. Weitere Informationen: | | Author: | David M. Mount; Clifford Stein | Verlag: | Springer Berlin | Sprache: | eng |
|
| | |
| | | |
| Weitere Suchbegriffe: allgemeine Informatikbücher - englischsprachig, allgemeine informatikbücher - englischsprachig, Algorithmus, Algorithm Implementation, Algorithms, Approximation Algorithms, Combinatorial Algorithms, Computational Geometry, Experimental Algorithms, Geometrie Algorithms, Graph Algorithms, Network Algorithms, combinatorial optimization |
| | |
| |