Experimental algorithmics : from algorithm design to robust and efficient software

>> Google Books

所蔵情報QRコード

Experimental algorithmics : from algorithm design to robust and efficient software / Rudolf Fleischer, Bernard Moret, Erik Meineche Schmidt (eds.)

資料種別:

図書

出版情報:

Berlin ; Tokyo : Springer, c2002

形態:

xvii, 278 p. ; 24 cm

シリーズ名:

Lecture notes in computer science ; 2547 <BA00009279>

著者名:

ISBN:

9783540003465 [3540003460]

書誌ID:

BA60719523

子書誌情報

フルテキスト

所蔵情報

他の版・巻

書誌詳細

注記:

Papers from the first Schloss Dagstuhl Seminar on Experimental Algorithmics (seminar no. 00371), held in September 2000
Includes bibliographical references and index
Also available via the Internet
"State-of-the-Art Survey"--Cover

主題:

Application software--Development; Computer algorithms; Data structures (Computer science)

言語:

英語

目次情報:

Algorithm Engineering for Parallel Computation / David A. Bader ; Bernard M. E. Moret ; Peter Sanders1：

Introduction / 1.1：

General Issues / 1.2：

Speedup / 1.3：

Why Speed? / 1.3.1：

What is Speed? / 1.3.2：

Speedup Anomalies / 1.3.3：

Reliable Measurements / 1.4：

Test Instances / 1.5：

Presenting Results / 1.6：

Machine-Independent Measurements? / 1.7：

High-Performance Algorithm Engineering for Shared-Memory Processors / 1.8：

Algorithms for SMPs / 1.8.1：

Leveraging PRAM Algorithms for SMPs / 1.8.2：

Conclusions / 1.9：

References

Examples of Algorithm Engineering for Parallel Computation / 1.A：

Visualization in Algorithm Engineering: Tools and Techniques / Camil Demetrescu ; Irene Finocchi ; Giuseppe F. Italiano ; Stefan NÃ¤her2：

Tools for Algorithm Visualization / 2.1：

Interesting Events versus State Mapping / 2.3：

Visualization in Algorithm Engineering / 2.4：

Animation Systems and Heuristics: Max Flow / 2.4.1：

Animation Systems and Debugging: Spring Embedding / 2.4.2：

Animation Systems and Demos: Geometric Algorithms / 2.4.3：

Animation Systems and Fast Prototyping / 2.4.4：

Conclusions and Further Directions / 2.5：

Parameterized Complexity: The Main Ideas and Connections to Practical Computing / Michael R. Fellows3：

Parameterized Complexity in a Nutshell / 3.1：

Empirical Motivation: Two Forms of Fixed-Parameter Complexity / 3.2.1：

The Halting Problem: A Central Reference Point / 3.2.2：

Connections to Practical Computing and Heuristics / 3.3：

A Critical Tool for Evaluating Approximation Algorithms / 3.4：

The Extremal Connection: A General Method Relating FPT, Polynomial-Time Approximation, and Pre-Processing Based Heuristics / 3.5：

A Comparison of Cache Aware and Cache Oblivious Static Search Trees Using Program Instrumentation / Richard E. Ladner ; Ray Fortna ; Bao-Hoang Nguyen4：

Organization / 4.1：

Cache Aware Search / 4.3：

Cache Oblivious Search / 4.4：

Program Instrumentation / 4.5：

Experimental Results / 4.6：

Conclusion / 4.7：

Using Finite Experiments to Study Asymptotic Performance / Catherine McGeoch ; Rudolf Fleischer ; Paul R. Cohen ; Doina Precup5：

Difficulties with Experimentation / 5.1：

Promising Examples / 5.3：

Theory with Simplifications: Writing to Parallel Disks / 5.3.1：

"Heuristic" Deduction: Random Polling / 5.3.2：

Shellsort / 5.3.3：

Sharpening a Theory: Randomized Balanced Allocation / 5.3.4：

Empirical Curve Bounding Rules / 5.4：

Guess Ratio / 5.4.1：

Guess Difference / 5.4.2：

The Power Rule / 5.4.3：

The BoxCox Rule / 5.4.4：

The Difference Rule / 5.4.5：

Two Negative Results / 5.4.6：

Parameterized Functions / 5.5：

Algorithmic Data Sets / 5.5.2：

A Hybrid Iterative Refinement Method / 5.6：

Remark / 5.6.1：

Discussion / 5.7：

WWW.BDD-Portal.ORG: An Experimentation Platform for Binary Decision Diagram Algorithms / Christoph Meinel ; Harald Sack ; Arno Wagner6：

WWW Portal Sites for Research Communities / 6.1：

Binary Decision Diagrams / 6.1.2：

A Benchmarking Platform for BDDs / 6.2：

To Publish Code is not Optimal / 6.2.1：

What is Really Needed / 6.2.2：

A Web-Based Testbed / 6.3：

The WWW Interface / 6.3.1：

Implementation / 6.3.2：

Available BDD Tools / 6.3.3：

Added Value: A BDD Portal Site / 6.4：

Structure of a Conventional Portal / 6.4.1：

Shortcomings of Conventional Portals / 6.4.2：

The BDD Portal / 6.4.3：

Online Operation Experiences / 6.5：

Related Work / 6.6：

Algorithms and Heuristics in VLSI Design / Christian Stangier7：

Preliminaries / 7.1：

OBDDs - Ordered Binary Decision Diagrams / 7.2.1：

Operations on OBDDs / 7.2.2：

Influence of the Variable Order on the OBDD Size / 7.2.3：

Reachability Analysis / 7.2.4：

Image Computation Using AndExist / 7.2.5：

Heuristics for Optimizing OBDD-Size - Variable Reordering / 7.3：

Sample Reordering Method / 7.3.1：

Speeding up Symbolic Model Checking with Sample Sifting / 7.3.2：

Experiments / 7.3.3：

Heuristics for Optimizing OBDD Applications - Partitioned Transition Relations / 7.4：

Common Partitioning Strategy / 7.4.1：

RTL Based Partitioning Heuristic / 7.4.2：

Reconstructing Optimal Phylogenetic Trees: A Challengein Experimental Algorithmics / Tandy Warnow7.4.3：

Data for Phylogeny Reconstruction / 8.1：

Phylogenetic Reconstruction Methods / 8.2.1：

Algorithmic and Experimental Challenges / 8.3：

Designing for Speed / 8.3.1：

Designing for Accuracy / 8.3.2：

Performance Evaluation / 8.3.3：

An Algorithm Engineering Example: Solving the Breakpoint Phylogeny / 8.4：

Breakpoint Analysis: Details / 8.4.1：

Re-Engineering BPAnalysis for Speed / 8.4.2：

A Partial Assessment / 8.4.3：

An Experimental Algorithmics Example: Quartet-Based Methods for DNA Data / 8.5：

Quartet-Based Methods / 8.5.1：

Experimental Design / 8.5.2：

Some Experimental Results / 8.5.3：

Observations and Conclusions / 8.6：

Presenting Data from Experiments in Algorithmics / 9：

The Process / 9.1：

Tables / 9.3：

Two-Dimensional Figures / 9.4：

The x Axis / 9.4.1：

The y Axis / 9.4.2：

Arranging Multiple Curves / 9.4.3：

Arranging Instances / 9.4.4：

How to Connect Measurements / 9.4.5：

Measurement Errors / 9.4.6：

Grids and Ticks / 9.5：

Three-Dimensional Figures / 9.6：

The Caption / 9.7：

A Check List / 9.8：

Distributed Algorithm Engineering / Paul G. Spirakis ; Christos D. Zaroliagis10：

The Need of a Simulation Environment / 10.1：

An Overview of Existing Simulation Environments / 10.2.1：

Asynchrony in Distributed Experiments / 10.3：

Difficult Input Instances for Distributed Experiments / 10.4：

The Adversarial-Based Approach / 10.4.1：

The Game-Theoretic Approach / 10.4.2：

Mobile Computing / 10.5：

Models of Mobile Computing / 10.5.1：

Basic Protocols in the Fixed Backbone Model / 10.5.2：

Basic Protocols in the Ad-Hoc Model / 10.5.3：

Modeling Attacks in Networks: A Useful Interplay between Theory and Practice / 10.6：

Implementations and Experimental Studies of Dynamic Graph Algorithms / 10.7：

Dynamic Algorithms for Undirected Graphs / 11.1：

Dynamic Connectivity / 11.2.1：

Dynamic Minimum Spanning Tree / 11.2.2：

Dynamic Algorithms for Directed Graphs / 11.3：

Dynamic Transitive Closure / 11.3.1：

Dynamic Shortest Paths / 11.3.2：

A Software Library for Dynamic Graph Algorithms / 11.4：

Author Index / 11.5：

Algorithm Engineering for Parallel Computation / David A. Bader ; Bernard M. E. Moret ; Peter Sanders1：

Introduction / 1.1：

General Issues / 1.2：

Speedup / 1.3：

Why Speed? / 1.3.1：

What is Speed? / 1.3.2：

続きを見る

東工大ブックレビュー

類似資料:

1 電子ブック Experimental Algorithmics Rudolf Fleischer, Fleischer, Rudolf, Moret, Bernard M. E., Schmidt, Erik Meineche, Meineche Schmidt, Erik, Moret, … SpringerLink Books - AutoHoldings, Springer Berlin Heidelberg	7 図書 Genetic algorithms + data structures = evolution programs (: gw ; : us) Michalewicz, Zbigniew, 1952- Springer-Verlag
2 図書 Data structure and algorithms with object-oriented design patterns in Java Preiss, Bruno R. John Wiley & Sons	8 図書 Algorithm theory--SWAT '94 : 4th Scandinavian Workshop on Algorithm Theory, Aarhus, Denmark, July 6-8, 1994 : proceedings (: gw ; : us) Scandinavian Workshop on Algorithm Theory, Schmidt, E. M. (Erik Meineche), 1945-, Skyum, Sven, 1946- Springer-Verlag
3 図書 Algorithms and data structures in C++ Ammeraal, L. (Leendert) Wiley	9 図書 Algorithm theory -- SWAT 2002 : 8th Scandinavian Workshop on Algorithm Theory, Turku, Finland, July 3-5, 2002 : proceedings Scandinavian Workshop on Algorithm Theory, Penttonen, Martti, 1948-, Schmidt, E. M. (Erik Meineche), 1945- Springer
4 図書 Data structures and algorithm analysis Weiss, Mark Allen Benjamin/Cummings Pub. Co.	10 電子ブック Algorithms in Bioinformatics Bücher, Philipp, B・・ucher, Philip, Kanade, Takeo, Moret, Bernard M. E. SpringerLink Books - AutoHoldings, Springer Berlin Heidelberg
5 電子ブック Data structures and algorithms in Python (: electronic bk) Goodrich, Michael T., Tamassia, Roberto, 1960-, Goldwasser, Michael H., 1969- Maruzen eBook Library	11 電子ブック Algorithm Theory — SWAT 2002 Scandinavian Workshop on Algorithm Theory, Penttonen, Martti, Schmidt, Erik Meineche SpringerLink Books - AutoHoldings, Springer Berlin Heidelberg
6 図書 Data structures and algorithms : a first course Adamson, Iain T. Springer	12 図書 Automata, languages, and programming : ninth colloquium, Aarhus, Denmark, July 12-16, 1982 (: gw ; : us) International Colloquium on Automata, Languages and Programming, Nielsen, M. (Mogens), 1949-, Schmidt, E. M. (Erik … Springer-Verlag