Stochastic Algorithms: Foundations and Applications [electronic resource] : Third International Symposium, SAGA 2005, Moscow, Russia, October 20-22, 2005. Proceedings / edited by Oleg B. Lupanov, Oktay M. Kasim-Zade, Alexander V. Chaskin, Kathleen Steinhȵfel.
Tipo de material:
TextoSeries Lecture Notes in Computer Science, 3777Editor: Berlin, Heidelberg : Springer Berlin Heidelberg, 2005Descripción: VIII, 240 p. online resourceTipo de contenido: text Tipo de medio: computer Tipo de portador: online resourceISBN: 9783540322450Trabajos contenidos: SpringerLink (Online service)Tema(s): Computer science | Computer software | Computational complexity | Algorithms | Distribution (Probability theory) | 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 | AlgorithmsFormatos físicos adicionales: Sin títuloClasificación CDD: 005.1 Clasificación LoC:Libro electrónicoRecursos en línea: de clik aquí para ver el libro electrónico 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.
ZDB-2-SCS
ZDB-2-LNC
No hay comentarios en este titulo.