04233nam 22007575 450 99646622510331620230406033925.010.1007/11571155(CKB)1000000000213317(SSID)ssj0000320214(PQKBManifestationID)11235205(PQKBTitleCode)TC0000320214(PQKBWorkID)10347462(PQKB)10230843(DE-He213)978-3-540-32245-0(MiAaPQ)EBC3067954(PPN)12309822X(EXLCZ)99100000000021331720100402d2005 u| 0engurnn|008mamaatxtccrStochastic 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öfel1st ed. 2005.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2005.1 online resource (VIII, 240 p.) Theoretical Computer Science and General Issues,2512-2029 ;3777Bibliographic Level Mode of Issuance: Monograph3-540-32245-0 3-540-29498-8 Includes bibliographical references and index.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.Theoretical Computer Science and General Issues,2512-2029 ;3777AlgorithmsComputer scienceComputer science—MathematicsMathematical statisticsDiscrete mathematicsProbabilitiesAlgorithmsTheory of ComputationProbability and Statistics in Computer ScienceDiscrete Mathematics in Computer ScienceProbability TheoryAlgorithms.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.518/.1Lupanov Oleg Bedthttp://id.loc.gov/vocabulary/relators/edtKasim-Zade Oktay Medthttp://id.loc.gov/vocabulary/relators/edtChaskin Alexander Vedthttp://id.loc.gov/vocabulary/relators/edtSteinhöfel Kathleenedthttp://id.loc.gov/vocabulary/relators/edtBOOK996466225103316Stochastic Algorithms: Foundations and Applications772662UNISA