Advertisement

Stochastic Algorithms: Foundations and Applications

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

  • Oleg B. Lupanov
  • Oktay M. Kasim-Zade
  • Alexander V. Chaskin
  • Kathleen Steinhöfel

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

Table of contents

  1. Front Matter
  2. Alexander Sapozhenko
    Pages 1-13
  3. Christos Zaroliagis
    Pages 45-47
  4. Jan Poland
    Pages 58-69
  5. Joachim Wegener
    Pages 82-94
  6. Hadi Nobahari, Seid H. Pourtakdoust
    Pages 95-106
  7. Elizaveta A. Okol’nishnikova
    Pages 107-115
  8. Chi Seong Park, Mun-Kyu Lee, Dong Kyue Kim
    Pages 170-179
  9. Martin Romauch, Richard F. Hartl
    Pages 180-189
  10. Adrian Horia Dediu, María Adela Grando
    Pages 228-238
  11. Back Matter

About these proceedings

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

Editors and affiliations

  • Oleg B. Lupanov
    • 1
  • Oktay M. Kasim-Zade
    • 1
  • Alexander V. Chaskin
    • 2
  • Kathleen Steinhöfel
    • 3
  1. 1.Department of Discrete Mathematics, Leninskie GoryMoscow State UniversityMoscowRussia
  2. 2.Faculty of Mechanics and Mathematics, Department of Discrete Mathematics, Leninskie GoryMoscow State UniversityMoscowRussia
  3. 3.Department of Computer ScienceKing’s College LondonLondonUK

Bibliographic information

  • DOI https://doi.org/10.1007/11571155
  • Copyright Information Springer-Verlag Berlin Heidelberg 2005
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-29498-6
  • Online ISBN 978-3-540-32245-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site