Stochastic Algorithms: Foundations and Applications
Second International Symposium, SAGA 2003, Hatfield, UK, September 22-23, 2003, Proceedings
Published on 20. November 2003
VIII, 172 pages
978-3-540-39816-5 (ISBN)
Description
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.
More details
Other editions
Additional editions
Andreas Albrecht | Kathleen Steinhöfel
Stochastic Algorithms: Foundations and Applications
Second International Symposium, SAGA 2003, Hatfield, UK, September 22-23, 2003, Proceedings
Book
09/2003
Springer
€53.49
Shipment within 10-15 days
Content
Prospects of Quantum Informatics.- A Converging ACO Algorithm for Stochastic Combinatorial Optimization.- Optimality of Randomized Algorithms for the Intersection Problem.- Stochastic Algorithms for Gene Expression Analysis.- Analysis of a Randomized Local Search Algorithm for LDPCC Decoding Problem.- Testing a Simulated Annealing Algorithm in a Classification Problem.- Global Search through Sampling Using a PDF.- Simulated Annealing for Optimal Pivot Selection in Jacobian Accumulation.- Quantum Data Compression.- Who'sThe Weakest Link?.- On the Stochastic Open Shop Problem.- Global Optimization - Stochastic or Deterministic?.- Two-Component Traffic Modelled by Cellular Automata: Imposing Passing Restrictions on Slow Vehicles Increases the Flow.- Average-Case Complexity of Partial Boolean Functions.- Classes of Binary Rational Distributions Closed under Discrete Transformations.
