This book constitutes the refereed proceedings of the Second International Symposium on Stochastic Algorithms: Foundations and Applications, SAGA 2003, held in Hatfield, UK in September 2003.
The 12 revised full papers presented together with three invited papers were carefully reviewed and selected for inclusion in the book. Among the topics addressed are ant colony optimization, randomized algorithms for the intersection problem, local search for constraint satisfaction problems, randomized local search and combinatorial optimization, simulated annealing, probabilistic global search, network communication complexity, open shop scheduling, aircraft routing, traffic control, randomized straight-line programs, and stochastic automata and probabilistic transformations.
Author(s): Roland Kirschner (auth.), Andreas Albrecht, Kathleen Steinhöfel (eds.)
Series: Lecture Notes in Computer Science 2827
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2003
Language: English
Pages: 172
Tags: Algorithm Analysis and Problem Complexity; Computation by Abstract Devices; Numeric Computing; Discrete Mathematics in Computer Science; Probability and Statistics in Computer Science; Algorithms
Front Matter....Pages -
Prospects of Quantum Informatics....Pages 1-9
A Converging ACO Algorithm for Stochastic Combinatorial Optimization....Pages 10-25
Optimality of Randomized Algorithms for the Intersection Problem....Pages 26-38
Stochastic Algorithms for Gene Expression Analysis....Pages 39-49
Analysis of a Randomized Local Search Algorithm for LDPCC Decoding Problem....Pages 50-60
Testing a Simulated Annealing Algorithm in a Classification Problem....Pages 61-70
Global Search through Sampling Using a PDF....Pages 71-82
Simulated Annealing for Optimal Pivot Selection in Jacobian Accumulation....Pages 83-97
Quantum Data Compression....Pages 98-107
Who’s The Weakest Link ?....Pages 108-116
On the Stochastic Open Shop Problem....Pages 117-124
Global Optimization – Stochastic or Deterministic?....Pages 125-137
Two-Component Traffic Modelled by Cellular Automata: Imposing Passing Restrictions on Slow Vehicles Increases the Flow....Pages 138-145
Average-Case Complexity of Partial Boolean Functions....Pages 146-156
Classes of Binary Rational Distributions Closed under Discrete Transformations....Pages 157-166
Back Matter....Pages -
