Experimental Algorithmics
Experimental Algorithmics

Author: Rudolf Fleischer

Publisher: Springer

Published: 2003-07-01

Total Pages: 295

ISBN-13: 3540363831

DOWNLOAD EBOOK

Experimental algorithmics, as its name indicates, combines algorithmic work and experimentation: algorithms are not just designed, but also implemented and tested on a variety of instances. Perhaps the most important lesson in this process is that designing an algorithm is but the first step in the process of developing robust and efficient software for applications. Based on a seminar held at Dagstuhl Castle, Germany in September 2000, this state-of-the-art survey presents a coherent survey of the work done in the area so far. The 11 carefully reviewed chapters provide complete coverage of all current topics in experimental algorithmics.

A Guide to Experimental Algorithmics
A Guide to Experimental Algorithmics

Author: Catherine C. McGeoch

Publisher: Cambridge University Press

Published: 2012-01-30

Total Pages: 273

ISBN-13: 1107001730

DOWNLOAD EBOOK

This is a guidebook for those who want to use computational experiments to support their work in algorithm design and analysis. Numerous case studies and examples show how to apply these concepts. All the necessary concepts in computer architecture and data analysis are covered so that the book can be used by anyone who has taken a course or two in data structures and algorithms.

Experimental Algorithms
Experimental Algorithms

Author: Paola Festa

Publisher: Springer

Published: 2010-04-28

Total Pages: 526

ISBN-13: 364213193X

DOWNLOAD EBOOK

Annotation. This volume constitutes the refereed proceedings of the 9th International Symposium on Experimental Algorithms, SEA 2010, held on Ischia Island, Naples, Italy, in May 2010. The 40 revised full papers presented together with two invited papers were carefully reviewed and selected from 73 submissions. The topics covered include algorithm engineering, algorithmic libraries, algorithmic mechanism design, analysis of algorithms, algorithms for memory hierarchies, approximation techniques, bioinformatics, branch and bound algorithms, combinatorial and irregular problems, combinatorial structures and graphs, communication networks, complex networks, computational geometry, computational learning theory, computational optimization, computer systems, cryptography and security, data streams, data structures, distributed and parallel algorithms, evaluation of algorithms for realistic environments, experimental techniques and statistics, graph drawing, heuristics for combinatorial optimization.

Experimental Algorithms
Experimental Algorithms

Author: Jan Vahrenhold

Publisher: Springer

Published: 2009-06-04

Total Pages: 302

ISBN-13: 3642020119

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 8th International Symposium on Experimental and Efficient Algorithms, SEA 2009, held in Dortmund, Germany, in June 2009. The 23 revised full papers were carefully reviewed and selected from 64 submissions and present current research on experimental evaluation and engineering of algorithms, as well as in various aspects of computational optimization and its applications. Contributions are supported by experimental evaluation, methodological issues in the design and interpretation of experiments, the use of (meta- ) heuristics, or application-driven case studies that deepen the understanding of a problem's complexity.

Experimental Algorithms
Experimental Algorithms

Author: Camil Demetrescu

Publisher: Springer

Published: 2007-06-27

Total Pages: 458

ISBN-13: 3540728457

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the 6th International Workshop on Experimental and Efficient Algorithms, WEA 2007, held in Rome, Italy, in June 2007. The 30 revised full papers presented together with three invited talks cover the design, analysis, implementation, experimental evaluation, and engineering of efficient algorithms.

Experimental and Efficient Algorithms
Experimental and Efficient Algorithms

Author: Celso C. Ribeiro

Publisher: Springer

Published: 2004-04-20

Total Pages: 595

ISBN-13: 3540248382

DOWNLOAD EBOOK

This book constitutes the refereed proceedings of the Third International Workshop on Experimental and Efficient Algorithms, WEA 2004, held in Angra dos Reis, Brazil in May 2004. The 40 revised full papers presented together with abstracts of two invited talks were carefully reviewed and selected from numerous submissions. The book is devoted to the areas of design, analysis, and experimental evaluation of algorithms. Among the topics covered are scheduling, heuristics, combinatorial optimization, evolutionary optimization, graph computations, labeling, robot navigation, shortest path algorithms, flow problems, searching, randomization and derandomization, string matching, graph coloring, networking, error detecting codes, timetabling, sorting, energy minimization, etc.

Encyclopedia of Algorithms
Encyclopedia of Algorithms

Author: Ming-Yang Kao

Publisher: Springer Science & Business Media

Published: 2008-08-06

Total Pages: 1200

ISBN-13: 0387307702

DOWNLOAD EBOOK

One of Springer’s renowned Major Reference Works, this awesome achievement provides a comprehensive set of solutions to important algorithmic problems for students and researchers interested in quickly locating useful information. This first edition of the reference focuses on high-impact solutions from the most recent decade, while later editions will widen the scope of the work. All entries have been written by experts, while links to Internet sites that outline their research work are provided. The entries have all been peer-reviewed. This defining reference is published both in print and on line.

Algorithm Engineering and Experiments
Algorithm Engineering and Experiments

Author: David M. Mount

Publisher: Springer Science & Business Media

Published: 2002-07-24

Total Pages: 215

ISBN-13: 3540439773

DOWNLOAD EBOOK

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.

Experimental Methods for the Analysis of Optimization Algorithms
Experimental Methods for the Analysis of Optimization Algorithms

Author: Thomas Bartz-Beielstein

Publisher: Springer Science & Business Media

Published: 2010-11-02

Total Pages: 469

ISBN-13: 3642025382

DOWNLOAD EBOOK

In operations research and computer science it is common practice to evaluate the performance of optimization algorithms on the basis of computational results, and the experimental approach should follow accepted principles that guarantee the reliability and reproducibility of results. However, computational experiments differ from those in other sciences, and the last decade has seen considerable methodological research devoted to understanding the particular features of such experiments and assessing the related statistical methods. This book consists of methodological contributions on different scenarios of experimental analysis. The first part overviews the main issues in the experimental analysis of algorithms, and discusses the experimental cycle of algorithm development; the second part treats the characterization by means of statistical distributions of algorithm performance in terms of solution quality, runtime and other measures; and the third part collects advanced methods from experimental design for configuring and tuning algorithms on a specific class of instances with the goal of using the least amount of experimentation. The contributor list includes leading scientists in algorithm design, statistical design, optimization and heuristics, and most chapters provide theoretical background and are enriched with case studies. This book is written for researchers and practitioners in operations research and computer science who wish to improve the experimental assessment of optimization algorithms and, consequently, their design.

Experimental Research in Evolutionary Computation
Experimental Research in Evolutionary Computation

Author: Thomas Bartz-Beielstein

Publisher: Springer Science & Business Media

Published: 2006-05-09

Total Pages: 221

ISBN-13: 354032027X

DOWNLOAD EBOOK

This book introduces the new experimentalism in evolutionary computation, providing tools to understand algorithms and programs and their interaction with optimization problems. It develops and applies statistical techniques to analyze and compare modern search heuristics such as evolutionary algorithms and particle swarm optimization. The book bridges the gap between theory and experiment by providing a self-contained experimental methodology and many examples.