Stochastic Algorithms: Foundations and Applications: Third International Symposium, SAGA 2005, Moscow, Russia, October 20-22, 2005. Proceedings

Alexander Sapozhenko (auth.), Oleg B. Lupanov, Oktay M. Kasim-Zade, Alexander V. Chaskin, Kathleen Steinhöfel (eds.)3540294988, 9783540294986

This book constitutes the refereed proceedings of the Third International Symposium on Stochastic Algorithms: Foundations and Applications, SAGA 2005, held in Moscow, Russia in October 2005.

The 14 revised full papers presented together with 5 invited papers were carefully reviewed and selected for inclusion in the book. The contributed papers included in this volume cover both theoretical as well as applied aspects of stochastic computations whith a special focus on new algorithmic ideas involving stochastic decisions and the design and evaluation of stochastic algorithms within realistic scenarios.

---

Table of contents :
Front Matter….Pages –
Systems of Containers and Enumeration Problems….Pages 1-13
Some Heuristic Analysis of Local Search Algorithms for SAT Problems….Pages 14-25
Clustering in Stochastic Asynchronous Algorithms for Distributed Simulations….Pages 26-37
On Construction of the Set of Irreducible Partial Covers….Pages 38-44
Recent Advances in Multiobjective Optimization….Pages 45-47
Polynomial Time Checking for Generation of Finite Distributions of Rational Probabilities….Pages 48-57
FPL Analysis for Adaptive Bandits….Pages 58-69
On Improved Least Flexibility First Heuristics Superior for Packing and Stock Cutting Problems….Pages 70-81
Evolutionary Testing Techniques….Pages 82-94
Optimal Fuzzy CLOS Guidance Law Design Using Ant Colony Optimization….Pages 95-106
On Some Bounds on the Size of Branching Programs (A Survey)….Pages 107-115
Two Metaheuristics for Multiobjective Stochastic Combinatorial Optimization….Pages 116-125
Self-replication, Evolvability and Asynchronicity in Stochastic Worlds….Pages 126-169
New Computation Paradigm for Modular Exponentiation Using a Graph Model….Pages 170-179
Dynamic Facility Location with Stochastic Demands….Pages 180-189
The Complexity of Classical and Quantum Branching Programs: A Communication Complexity Approach….Pages 190-201
On the Properties of Asymptotic Probability for Random Boolean Expression Values in Binary Bases….Pages 202-212
Solving a Dynamic Cell Formation Problem with Machine Cost and Alternative Process Plan by Memetic Algorithms….Pages 213-227
Eco-Grammar Systems as Models for Parallel Evolutionary Algorithms….Pages 228-238
Back Matter….Pages –