| The LNCS series reports state-of-the-art results in computer science research, development, and education, at a high level and in both printed and electronic form. Enjoying tight cooperation with the R&D community, with numerous individuals, as well as with prestigious organizations and societies, LNCS has grown into the most comprehensive computer science resarch forum available. The scope of LNCS, including its subseries LNAI, spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields. The type of material publised traditionally includes. -proceedings(published in time for the respective conference) -post-proceedings(consisting of thoroughly revised final full papers) -research monographs(which may be basde on outstanding PhD work, research projects, technical reports, etc.) |
| 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 Satisfiabilitv 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 Exoerimental Study Experimental Evaluation of a New Shortest Path Algorithm Getting More from Out-of-Core Columnsort VIII Table of Contents 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 Author Index |
内容加载中，请稍后...
商品评论（0条）