网上购物 货比三家
您现在的位置:快乐比价网 > 图书 > 其它 > 其它 > 商品详情

Algorithm Engineering 工程算法

分享到:
Algorithm Engineering 工程算法

最 低 价:¥99.00

定 价:¥110.00

作 者:Stefan Näher (Editor), DorotheaWagner (Editor) 著

出 版 社:湖南文艺出版社

出版时间:2001-12-1

I S B N:3540425128

商品详情

编辑推荐

内容简介

This series reports new developments in computer scicence research and teaching,quikly,informally,and at a high level.The timeliness of a manu-script is more important than its from,which may be unfinished or tentative.The type of material considered for publication includes
-drafts of original papers or monographs.
-technical reports of high quality and broad interest,
-advanced-level lectures,
-reports of meetings,provided they are of exceptional interest and focused on a single topic.
Publication of Lecture Notes is inteded as service to the computer science community in that the publisher Springer-Verlag offers global distribution of documents which would otherwise have a restricted readership.One pub-lished and copyrighted they can be cited in the scientific literature.

作者简介

目录

Invited Lectures
On the Differences between“Practical”and“Applied”
Contributed Papers
An Experimental Study of Online Scheduling Algorithms
Implementation of O(nmlogn)Weighted Matchings in General Graphs.The Power of Data Structures
Pushing the Limits in Sequential Sorting
Efficient Sorting Using Registers and Caches
Lattice Basis Reduction with Dynamic Aoproximation
Clustering Data without Prior Knowledge
Recognizing Bundles in Time Table Graphs-A Structural Approach
Analysm ana Expenmental EvaluaLlon of an Innovative and Efficient Routing Protocol for Ad-hoc Mobile Networks
Portable List Ranking:An Experimental Study
Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM
Asymptotic Complexity from Experiments?A Case Study for Randomized Algorithms
Visualizing Algorithms over the Web with the Publication-Driven Approach
Interchanging Two Segments of an Array in a Hierarchical Memory System
Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves
Planar Point Location for Large Data Sets:To Seek or Not to Seek
Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees
Dynamic Maintenance Versus Swapping:An Experimental Study on Shortest Paths Trees
Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights:An Experimental Study
New Algorithms for Examination Timetabling
Author Index

商品评论(0条)

暂无评论!

您的浏览历史

loading 内容加载中,请稍后...