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

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Lupanov, Oleg B. (Editor ), Kasim-Zade, Oktay M. (Editor ), Chaskin, Alexander V. (Editor ), Steinhöfel, Kathleen (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005.
Edición:1st ed. 2005.
Colección:Theoretical Computer Science and General Issues, 3777
Temas:
Algorithms.
Computer science.
Computer science-Mathematics.
Mathematical statistics.
Discrete mathematics.
Probabilities.
Theory of Computation.
Probability and Statistics in Computer Science.
Discrete Mathematics in Computer Science.
Probability Theory.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • 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.

Ejemplares similares