Stochastic Algorithms: Foundations and Applications: International Symposium, SAGA 2001 Berlin, Germany, December 13-14, 2001 Proceedings

by Kathleen Steinhöfel (Editor)

Overview

SAGA 2001, the first Symposium on Shastic Algorithms, Foundations and Applications, took place on December 13–14, 2001 in Berlin, Germany. The present volume comprises contributed papers and four invited talks that were included in the final program of the symposium. Shastic algorithms constitute a general approach to finding approximate solutions to a wide variety of problems. Although there is no formal proof that shastic algorithms perform better than deterministic ones, there is evidence by empirical observations that shastic algorithms produce for a broad range of applications near-optimal solutions in a reasonable run-time. The symposium aims to provide a forum for presentation of original research in the design and analysis, experimental evaluation, and real-world application of shastic algorithms. It focuses, in particular, on new algorithmic ideas invo- ing shastic decisions and exploiting probabilistic properties of the underlying problem domain. The program of the symposium reffects the effort to promote cooperation among practitioners and theoreticians and among algorithmic and complexity researchers of the field. In this context, we would like to express our special gratitude to DaimlerChrysler AG for supporting SAGA 2001. The contributed papers included in the proceedings present results in the following areas: Network and distributed algorithms; local search methods for combinatorial optimization with application to constraint satisfaction problems, manufacturing systems, motor control unit calibration, and packing—exible - jects; and computational learning theory.

Product Details

ISBN-13:	9783540430254
Publisher:	Springer Berlin Heidelberg
Publication date:	01/10/2002
Series:	Lecture Notes in Computer Science , #2264
Edition description:	2001
Pages:	208
Product dimensions:	6.10(w) x 9.25(h) x 0.02(d)

Table of Contents

Randomized Communication Prools.- Optimal Mutation Rate Using Bayesian Priors for Estimation of Distribution Algorithms.- An Experimental Assessment of a Shastic, Anytime, Decentralized, Soft Colourer for Sparse Graphs.- Randomized Branching Programs.- Yet Another Local Search Method for Constraint Solving.- An Evolutionary Algorithm for the Sequence Coordination in Furniture Production.- Evolutionary Search for Smooth Maps in Motor Control Unit Calibration.- Some Notes on Random Satisfiability.- Prospects for Simulated Annealing Algorithms in Automatic Differentiation.- Optimization and Simulation: Sequential Packing of Flexible Objects Using Evolutionary Algorithms.- Shastic Finite Learning.- Sequential Sampling Algorithms: Unified Analysis and Lower Bounds.- Approximate Location of Relevant Variables under the Crossover Distribution.