Stochastic Algorithms: Foundations and Applications Third International Symposium, SAGA 2005, Moscow, Russia, October 20-22, 2005 /
Stochastic Algorithms: Foundations and Applications Third International Symposium, SAGA 2005, Moscow, Russia, October 20-22, 2005 / [electronic resource] :
edited by Oleg B. Lupanov, Oktay M. Kasim-Zade, Alexander V. Chaskin, Kathleen Steinhöfel.
- 1st ed. 2005.
- VIII, 240 p. online resource.
- Theoretical Computer Science and General Issues, 3777 2512-2029 ; .
- Theoretical Computer Science and General Issues, 3777 .
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.
9783540322450
10.1007/11571155 doi
Algorithms.
Computer science.
Computer science--Mathematics.
Mathematical statistics.
Discrete mathematics.
Probabilities.
Algorithms.
Theory of Computation.
Probability and Statistics in Computer Science.
Discrete Mathematics in Computer Science.
Probability Theory.
QA76.9.A43
518.1
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.
9783540322450
10.1007/11571155 doi
Algorithms.
Computer science.
Computer science--Mathematics.
Mathematical statistics.
Discrete mathematics.
Probabilities.
Algorithms.
Theory of Computation.
Probability and Statistics in Computer Science.
Discrete Mathematics in Computer Science.
Probability Theory.
QA76.9.A43
518.1