LEADER 04233nam  22007575  450 
001 996466225103316
005 20230406033925.0
024 7 $a10.1007/11571155
035   $a(CKB)1000000000213317
035   $a(SSID)ssj0000320214
035   $a(PQKBManifestationID)11235205
035   $a(PQKBTitleCode)TC0000320214
035   $a(PQKBWorkID)10347462
035   $a(PQKB)10230843
035   $a(DE-He213)978-3-540-32245-0
035   $a(MiAaPQ)EBC3067954
035   $a(PPN)12309822X
035   $a(EXLCZ)991000000000213317
100   $a20100402d2005      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aStochastic Algorithms: Foundations and Applications$b[electronic resource] $eThird International Symposium, SAGA 2005, Moscow, Russia, October 20-22, 2005 /$fedited by Oleg B. Lupanov, Oktay M. Kasim-Zade, Alexander V. Chaskin, Kathleen Steinhöfel
205   $a1st ed. 2005.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2005.
215   $a1 online resource (VIII, 240 p.) 
225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3777
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-32245-0 
311   $a3-540-29498-8 
320   $aIncludes bibliographical references and index.
327   $aSystems 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.
410  0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v3777
606   $aAlgorithms
606   $aComputer science
606   $aComputer science?Mathematics
606   $aMathematical statistics
606   $aDiscrete mathematics
606   $aProbabilities
606   $aAlgorithms
606   $aTheory of Computation
606   $aProbability and Statistics in Computer Science
606   $aDiscrete Mathematics in Computer Science
606   $aProbability Theory
615  0$aAlgorithms.
615  0$aComputer science.
615  0$aComputer science?Mathematics.
615  0$aMathematical statistics.
615  0$aDiscrete mathematics.
615  0$aProbabilities.
615 14$aAlgorithms.
615 24$aTheory of Computation.
615 24$aProbability and Statistics in Computer Science.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aProbability Theory.
676   $a518/.1
702   $aLupanov$b Oleg B$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aKasim-Zade$b Oktay M$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aChaskin$b Alexander V$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aSteinhöfel$b Kathleen$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a996466225103316
996   $aStochastic Algorithms: Foundations and Applications$9772662
997   $aUNISA