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

• Corporate Author: SpringerLink (Online service)
• Other Authors: Lupanov, Oleg B. (Editor), Kasim-Zade, Oktay M. (Editor), Chaskin, Alexander V. (Editor), Steinhöfel, Kathleen (Editor)
• Format: Electronic eBook
• Language: English
• Published: Berlin, Heidelberg : Springer Berlin Heidelberg, 2005.
• Series: Lecture Notes in Computer Science, 3777
• Subjects: Computer science.; Computers.; Algorithms.; Computer science > Mathematics.; Mathematical statistics.; Probabilities.; Computer Science.; Algorithm Analysis and Problem Complexity.; Computation by Abstract Devices.; Probability and Statistics in Computer Science.; Discrete Mathematics in Computer Science.; Probability Theory and Stochastic Processes.

Table of Contents:

• 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.