Vai al contenuto principale della pagina
Titolo: |
Stochastic Algorithms: Foundations and Applications [[electronic resource] ] : Third International Symposium, SAGA 2005, Moscow, Russia, October 20-22, 2005 / / edited by Oleg B. Lupanov, Oktay M. Kasim-Zade, Alexander V. Chaskin, Kathleen Steinhöfel
![]() |
Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
Edizione: | 1st ed. 2005. |
Descrizione fisica: | 1 online resource (VIII, 240 p.) |
Disciplina: | 518/.1 |
Soggetto topico: | 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 | |
Persona (resp. second.): | LupanovOleg B |
Kasim-ZadeOktay M | |
ChaskinAlexander V | |
SteinhöfelKathleen | |
Note generali: | Bibliographic Level Mode of Issuance: Monograph |
Nota di bibliografia: | Includes bibliographical references and index. |
Nota di contenuto: | 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. |
Titolo autorizzato: | Stochastic Algorithms: Foundations and Applications ![]() |
Formato: | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione: | Inglese |
Record Nr.: | 996466225103316 |
Lo trovi qui: | Univ. di Salerno |
Opac: | Controlla la disponibilità qui |