1 option
Stochastic Algorithms: Foundations and Applications : 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.
SpringerLink Books Lecture Notes In Computer Science (LNCS) (1997-2024) Available online
View online- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- LNCS sublibrary. Theoretical computer science and general issues ; SL 1, 3777.
- Theoretical Computer Science and General Issues ; 3777
- Language:
- English
- Subjects (All):
- Algorithms.
- Computers.
- Mathematical statistics.
- Computer science--Mathematics.
- Computer science.
- Probabilities.
- 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.
- Local Subjects:
- 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.
- Algorithms.
- Physical Description:
- 1 online resource (VIII, 240 pages).
- Edition:
- First edition 2005.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005.
- System Details:
- text file PDF
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-32245-0
- 9783540322450
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.