Algorithms are essential building blocks of computer applications. However, advancements in computer hardware, which render traditional computer models more and more unrealistic, and an ever increasing demand for efficient solution to actual real world problems have led to a rising gap between classical algorithm theory and algorithmics in practice. The emerging discipline of Algorithm Engineering aims at bridging this gap. Driven by concrete applications, Algorithm Engineering complements theory by the benefits of experimentation and puts equal emphasis on all aspects arising during a cyclic solution process ranging from realistic modeling, design, analysis, robust and efficient implementations to careful experiments. This tutorial - outcome of a GI-Dagstuhl Seminar held in Dagstuhl Castle in September 2006 - covers the essential aspects of this process in ten chapters on basic ideas, modeling and design issues, analysis of algorithms, realistic computer models, implementation aspects and algorithmic software libraries, selected case studies, as well as challenges in Algorithm Engineering. Both researchers and practitioners in the field will find it useful as a state-of-the-art survey.
Algorithm Engineering is a methodology for algorithmic research that combines theory with implementation and experimentation in order to obtain better algorithms with high practical impact. Traditionally, the study of algorithms was dominated by mathematical (worst-case) analysis. In Algorithm Engineering, algorithms are also implemented and experiments conducted in a systematic way, sometimes resembling the experimentation processes known from fields such as biology, chemistry, or physics. This helps in counteracting an otherwise growing gap between theory and practice.
Reducing the variation in process outputs is a key part of process improvement. For mass produced components and assemblies, reducing variation can simultaneously reduce overall cost, improve function and increase customer satisfaction with the product. The authors have structured this book around an algorithm for reducing process variation that they call "Statistical Engineering." The algorithm is designed to solve chronic problems on existing high to medium volume manufacturing and assembly processes. The fundamental basis for the algorithm is the belief that we will discover cost effective changes to the process that will reduce variation if we increase our knowledge of how and why a process behaves as it does. A key way to increase process knowledge is to learn empirically, that is, to learn by observation and experimentation. The authors discuss in detail a framework for planning and analyzing empirical investigations, known by its acronym QPDAC (Question, Plan, Data, Analysis, Conclusion). They classify all effective ways to reduce variation into seven approaches. A unique aspect of the algorithm forces early consideration of the feasibility of each of the approaches. Also includes case studies, chapter exercises, chapter supplements, and six appendices. PRAISE FOR Statistical Engineering "I found this book uniquely refreshing. Don't let the title fool you. The methods described in this book are statistically sound but require very little statistics. If you have ever wanted to solve a problem with statistical certainty (without being a statistician) then this book is for you. - A reader in Dayton, OH "This is the most comprehensive treatment of variation reduction methods and insights I’ve ever seen."- Gary M. Hazard Tellabs "Throughout the text emphasis has been placed on teamwork, fixing the obvious before jumping to advanced studies, and cost of implementation. All this makes the manuscript !attractive for real-life application of complex techniques." - Guru Chadhabr Comcast IP Services COMMENTS FROM OTHER CUSTOMERS Average Customer Rating (5 of 5 based on 1 review) "This is NOT a typical book on statistical tools. It is a strategy book on how to search for cost-effective changes to reduce variation using empirical means (i.e. observation and experiment). The uniqueness of this book: Summarizes the seven ways to reduce variation so we know the goal of the data gathering and analysis, present analysis results using graphs instead of P-value, and integrates Taguchi, Shainin methods, and classical statistical approach. It is a must read for those who are in the business of reducing variation using data, in particular for the Six Sigma Black Belts and Master Black Belts. Don't forget to read the solutions to exercises and supplementary materials to each chapter on the enclosed CD-ROM." - A. Wong, Canada
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 / Gonzalo Navarro / - The Max-Shift algorithm for approximate string matching / Costas S. Iliopoulos / - Fractal matrix multiplication : a case study on portability of cache performance / Gianfranco Bilardi / - Experiences with the design and implementation of space-efficient deques / Jyrki Katajainen / - Designing and implementing a general purpose halfedge data structure / Hervé Brönnimann / - Optimised predecessor data structures for internal memory / Naila Rahman / - An adaptable and expensible geometry kernel / Susan Hert / - Efficient resource allocation with noisy functions / Arne Andersson / - Improving the efficiency of branch and bound algorithms for the simple plant location problem / Boris Goldengorin / - Exploiting partial knowledge of satisfying assignments / Kazuo Iwama / - Using PRAM algorithms on a uniform-memory-access shared-memory architecture / David A. Bader / - An experimental study of basic communicat ...
This volume contains the papers accepted for the 4th Workshop on Algorithm Engineering (WAE 2000) held in Saarbruc ̈ ken, Germany, during 5–8 September 2000, together with the abstract of the invited lecture given by Karsten Weihe. The Workshop on Algorithm Engineering covers research on all aspects of the subject. The goal is to present recent research results and to identify and explore directions for future research. Previous meetings were held in Venice (1997), Saarbruc ̈ ken (1998), and London (1999). Papers were solicited describing original research in all aspects of algorithm engineering, including: – Development of software repositories and platforms which allow the use of and experimentation with e?cient discrete algorithms. – Novel uses of discrete algorithms in other disciplines and the evaluation of algorithms for realistic environments. – Methodological issues including standards in the context of empirical - search on algorithms and data structures. – Methodological issues regarding the process of converting user requirements into e?cient algorithmic solutions and implementations. The program committee accepted 16 from a total of 30 submissions. The program committee meeting was conducted electronically. The criteria for sel- tion were originality, quality, and relevance to the subject area of the workshop. Considerable e?ort was devoted to the evaluation of the submissions and to p- viding the authors with feedback. Each submission was reviewed by at least four program committee members (assisted by subreferees). A special issue of the ACM Journal of Experimental Algorithmics will be devoted to selected papers from WAE 2000.
This book constitutes the refereed proceedings of the Third International Workshop on Algorithm Engineering, WAE'99, held in London, UK in July 1999. The 24 revised full papers presented were carefully reviewed and selected from a total of 46 submissions. The papers present original research results in all aspects of algorithm engineering including implementation, experimental testing, fine-tuning of discrete algorithms, development of repositories of software, methodological issues such as standards for empirical research on algorithms and data structures, and issues in the process of converting user requirements into efficient algorithmic solutions and implementations.
poggi@inf. puc-rio. br,rwerneck@cs. princeton. edu Abstract. Someofthemostwidelyusedconstructiveheuristicsforthe Steiner Problem in Graphs are based on algorithms for the Minimum Spanning Tree problem. In this paper, we examine e?cient implem- tations of heuristics based on the classic algorithms by Prim, Kruskal, and Bor? uvka.
Algorithm engineering allows computer engineers to produce a computational machine that will execute an algorithm as efficiently and cost-effectively as possible given a set of constraints, such as minimal performance or the availability of technology. Addressing algorithm engineering in a parallel setting, regular array syntheses offer powerful computation and embody best practice, but often face the criticism that they are applicable only to restricted classes of algorithms. Algorithm Engineering for Integral and Dynamic Problems reviews the basic principles of regular array synthesis and shows how to extend its use into classes of algorithms traditionally viewed to be beyond its domain of application. The author discusses the transformation of the initial algorithm specification into a specification with data dependencies of increased regularity in order to obtain corresponding regular arrays by direct application of the standard mapping techniques. The book includes a review of the basic principles of regular array synthesis followed by applications of these techniques to well-known algorithms, concluding with numerous case studies to illustrate the methods. Researchers and practitioners in algorithm engineering will find that this text significantly extends their understanding of the applications of regular array synthesis and regular array processors beyond the traditionally narrow field of relevance.
