000 03868nam a22006255i 4500
001 978-3-540-32245-0
003 DE-He213
005 20240423125600.0
007 cr nn 008mamaa
008 100402s2005 gw | s |||| 0|eng d
020 _a9783540322450
_9978-3-540-32245-0
024 7 _a10.1007/11571155
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
072 7 _aUMB
_2thema
082 0 4 _a518.1
_223
245 1 0 _aStochastic Algorithms: Foundations and Applications
_h[electronic resource] :
_bThird International Symposium, SAGA 2005, Moscow, Russia, October 20-22, 2005 /
_cedited by Oleg B. Lupanov, Oktay M. Kasim-Zade, Alexander V. Chaskin, Kathleen Steinhöfel.
250 _a1st ed. 2005.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2005.
300 _aVIII, 240 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v3777
505 0 _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.
650 0 _aAlgorithms.
650 0 _aComputer science.
650 0 _aComputer science
_xMathematics.
650 0 _aMathematical statistics.
650 0 _aDiscrete mathematics.
650 0 _aProbabilities.
650 1 4 _aAlgorithms.
650 2 4 _aTheory of Computation.
650 2 4 _aProbability and Statistics in Computer Science.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aProbability Theory.
700 1 _aLupanov, Oleg B.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aKasim-Zade, Oktay M.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aChaskin, Alexander V.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aSteinhöfel, Kathleen.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540294986
776 0 8 _iPrinted edition:
_z9783540816898
830 0 _aTheoretical Computer Science and General Issues,
_x2512-2029 ;
_v3777
856 4 0 _uhttps://doi.org/10.1007/11571155
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
942 _cSPRINGER
999 _c179534
_d179534