Skip to main content
SpringerLink
Log in
Book cover

Stochastic Algorithms: Foundations and Applications

Third International Symposium, SAGA 2005, Moscow, Russia, October 20-22, 2005

  • Conference proceedings
  • © 2005

Overview

Editors:
  1. Oleg B. Lupanov

    1. Department of Discrete Mathematics, Leninskie Gory, Moscow State University, Moscow, Russia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Oktay M. Kasim-Zade

    1. Department of Discrete Mathematics, Leninskie Gory, Moscow State University, Moscow, Russia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Alexander V. Chaskin

    1. Faculty of Mechanics and Mathematics, Department of Discrete Mathematics, Leninskie Gory, Moscow State University, Moscow, Russia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Kathleen Steinhöfel

    1. Department of Computer Science, King’s College London, London, UK

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 3777)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: SAGA 2005.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (19 papers)

  1. Front Matter

    Download chapter PDF

  2. Systems of Containers and Enumeration Problems

    • Alexander Sapozhenko
    Pages 1-13

  3. Some Heuristic Analysis of Local Search Algorithms for SAT Problems

    • Osamu Watanabe
    Pages 14-25

  4. Clustering in Stochastic Asynchronous Algorithms for Distributed Simulations

    • Anatoli Manita, François Simonot
    Pages 26-37

  5. On Construction of the Set of Irreducible Partial Covers

    • Mikhail Ju. Moshkov
    Pages 38-44

  6. Recent Advances in Multiobjective Optimization

    • Christos Zaroliagis
    Pages 45-47

  7. Polynomial Time Checking for Generation of Finite Distributions of Rational Probabilities

    • Roman Kolpakov
    Pages 48-57

  8. FPL Analysis for Adaptive Bandits

    • Jan Poland
    Pages 58-69

  9. On Improved Least Flexibility First Heuristics Superior for Packing and Stock Cutting Problems

    • Yu-Liang Wu, Chi-Kong Chan
    Pages 70-81

  10. Evolutionary Testing Techniques

    • Joachim Wegener
    Pages 82-94

  11. Optimal Fuzzy CLOS Guidance Law Design Using Ant Colony Optimization

    • Hadi Nobahari, Seid H. Pourtakdoust
    Pages 95-106

  12. On Some Bounds on the Size of Branching Programs (A Survey)

    • Elizaveta A. Okol’nishnikova
    Pages 107-115

  13. Two Metaheuristics for Multiobjective Stochastic Combinatorial Optimization

    • Walter J. Gutjahr
    Pages 116-125

  14. Self-replication, Evolvability and Asynchronicity in Stochastic Worlds

    • Chrystopher L. Nehaniv
    Pages 126-169

  15. New Computation Paradigm for Modular Exponentiation Using a Graph Model

    • Chi Seong Park, Mun-Kyu Lee, Dong Kyue Kim
    Pages 170-179

  16. Dynamic Facility Location with Stochastic Demands

    • Martin Romauch, Richard F. Hartl
    Pages 180-189

  17. The Complexity of Classical and Quantum Branching Programs: A Communication Complexity Approach

    • Farid Ablayev
    Pages 190-201

  18. On the Properties of Asymptotic Probability for Random Boolean Expression Values in Binary Bases

    • Alexey D. Yashunsky
    Pages 202-212

  19. Solving a Dynamic Cell Formation Problem with Machine Cost and Alternative Process Plan by Memetic Algorithms

    • Reza Tavakkoli-Moghaddam, Nima Safaei, Masoud Babakhani
    Pages 213-227

  20. Eco-Grammar Systems as Models for Parallel Evolutionary Algorithms

    • Adrian Horia Dediu, María Adela Grando
    Pages 228-238
Back to top

Other volumes

  1. Stochastic Algorithms: Foundations and Applications

Keywords

Editors and Affiliations

  • Department of Discrete Mathematics, Leninskie Gory, Moscow State University, Moscow, Russia

    Oleg B. Lupanov, Oktay M. Kasim-Zade

  • Faculty of Mechanics and Mathematics, Department of Discrete Mathematics, Leninskie Gory, Moscow State University, Moscow, Russia

    Alexander V. Chaskin

  • Department of Computer Science, King’s College London, London, UK

    Kathleen Steinhöfel

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation