Skip to main content
  • Conference proceedings
  • © 2005

Stochastic Algorithms: Foundations and Applications

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

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)

Conference series link(s): SAGA: International Symposium on Stochastic Algorithms

Conference proceedings info: SAGA 2005.

Buying options

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (19 papers)

  1. Front Matter

  2. Systems of Containers and Enumeration Problems

    • Alexander Sapozhenko
    Pages 1-13
  3. Recent Advances in Multiobjective Optimization

    • Christos Zaroliagis
    Pages 45-47
  4. FPL Analysis for Adaptive Bandits

    • Jan Poland
    Pages 58-69
  5. Evolutionary Testing Techniques

    • Joachim Wegener
    Pages 82-94
  6. Optimal Fuzzy CLOS Guidance Law Design Using Ant Colony Optimization

    • Hadi Nobahari, Seid H. Pourtakdoust
    Pages 95-106
  7. On Some Bounds on the Size of Branching Programs (A Survey)

    • Elizaveta A. Okol’nishnikova
    Pages 107-115
  8. New Computation Paradigm for Modular Exponentiation Using a Graph Model

    • Chi Seong Park, Mun-Kyu Lee, Dong Kyue Kim
    Pages 170-179
  9. Dynamic Facility Location with Stochastic Demands

    • Martin Romauch, Richard F. Hartl
    Pages 180-189
  10. Eco-Grammar Systems as Models for Parallel Evolutionary Algorithms

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

Other Volumes

  1. Stochastic Algorithms: Foundations and Applications

Keywords

  • Erfüllbarkeitsproblem der Aussagenlogik
  • algorithm
  • algorithms
  • ant colony optimization
  • approximation
  • combinatorial optimization
  • complexity
  • eco-grammar systems
  • evolutionary algorithm
  • evolutionary algorithms
  • nondeterministic computation
  • optimization
  • probabilistic transformations
  • quantum computations
  • randomization
  • algorithm analysis and problem complexity

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

Buying options

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

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions