算法工程（第5届国际专题会议）Algorithm engineering
点此进入淘宝搜索页搜索分类: 图书,计算机/网络,计算机理论,
作者： Gerd Stoelting Brodal 著
出 版 社： 湖南文艺出版社
出版时间： 2001-12-1字数：版次： 1页数： 196印刷时间： 2006/02/01开本：印次：纸张： 胶版纸I S B N ： 9783540425007包装： 平装编辑推荐
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.)
内容简介
This book constitutes the refereed proceedings of the 5th Workshop on Algorithm Engineering, WAE 2001, held in Aarhus, Denmark, in August 2001. The 15 revised full papers presented were carefully reviewed and selected from 25 submissions. Among the topics addressed are implementation, experimental testing, and fine-tuning of discrete algorithms; novel use of discrete algorithms in other disciplines; empirical research on algorithms and data structures; and methodological issues regarding the process of converting user requirements into efficient algorithmic solutions and implemenations.
目录
Compact DFA Representation for Fast Regular Expression Search
The Max-Shift Algorithm for Approximate String Matching
Fractal Matrix Multiplication: A Case Study on Portability of Cache Performance
Experiences with the Design and Implementation of Space-Efficient Deques
Designing and Implementing a General Purpose Halfedge Data Structure
Optimised Predecessor Data Structures for Internal Memory
An Adaptable and Extensible Geometry Kernel
Efficient Resource Allocation with Noisy Functions
Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem
Exploiting Partial Knowledge of Satisfying Assignments
Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture
An Experimental Study of Data Migration Algorithms
An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks
Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry
Pareto Shortest Paths is Often Feasible in Practice
Author Index
