Titel: Stochastic Algorithms: Foundations and Applications
Third International Symposium, SAGA 2005, Moscow, Russia, October 20-22, 2005, Proceedings.
'Lecture Notes in Computer Science'. 'Theoretical Computer Science and General Issues'.
1st ed. 2005.
Herausgegeben von Oleg B. Lupanov, Oktay M. Kasim-Zade, Alexander V. Chaskin
13. Oktober 2005 - kartoniert - VIII
This volume constitutes the proceedings of the 3rd Symposium on Stochastic Algorithms, Foundations and Applications (SAGA 2005), held in Moscow, R- sia, at Moscow State University on October 20-22, 2005. The symposium was organized by the Department of Discrete Mathematics, Faculty of Mechanics and Mathematics of Moscow State University and was partially supported by the Russian Foundation for Basic Research under Project No. 05-01-10140-?. The SAGA symposium series is a biennial meeting which started in 2001 in Berlin, Germany(LNCS vol. 2264). The second symposium was held in Sept- ber 2003 at the University of Hertfordshire, Hat?eld, UK (LNCS vol. 2827). Sincethe?rstsymposiuminBerlinin2001,anincreasedinterestintheSAGA series can be noticed. For SAGA 2005, we received submissions from China, the European Union, Iran, Japan, Korea, Russia, SAR Hong Kong, Taiwan, and USA, fromwhich 14 papers were?nally selected for publication after a thorough reviewing process. The contributed papers included in this volume cover both theoretical as well as applied aspects of stochastic computations, which is one of the main aims of the SAGA series. Furthermore, ?ve invited lectures were delivered at SAGA 2005: The talk by Alexander A. Sapozhenko (Moscow State University) summarizes results on the container method, a technique that is used to solve enumeration problems for various combinatorial structures and which has - merous applications in the design andanalysisof stochasticalgorithms. Christos D. Zaroliagis (University of Patras) presented recent advances in multiobjective optimization.
Systems of Containers and Enumeration Problems.
Some Heuristic Analysis of Local Search Algorithms for SAT Problems.
Clustering in Stochastic Asynchronous Algorithms for Distributed Simulations.
On Construction of the Set of Irreducible Partial Covers.
Recent Advances in Multiobjective Optimization.
Polynomial Time Checking for Generation of Finite Distributions of Rational Probabilities.
FPL Analysis for Adaptive Bandits.
On Improved Least Flexibility First Heuristics Superior for Packing and Stock Cutting Problems.
Evolutionary Testing Techniques.
Optimal Fuzzy CLOS Guidance Law Design Using Ant Colony Optimization.
On Some Bounds on the Size of Branching Programs (A Survey).
Two Metaheuristics for Multiobjective Stochastic Combinatorial Optimization.
Self-replication, Evolvability and Asynchronicity in Stochastic Worlds.
New Computation Paradigm for Modular Exponentiation Using a Graph Model.
Dynamic Facility Location with Stochastic Demands.
The Complexity of Classical and Quantum Branching Programs: A Communication Complexity Approach.
On the Properties of Asymptotic Probability for Random Boolean Expression Values in Binary Bases.
Solving a Dynamic Cell Formation Problem with Machine Cost and Alternative Process Plan by Memetic Algorithms.
Eco-Grammar Systems as Models for Parallel Evolutionary Algorithms.