Stochastic Algorithms: Foundations and Applications

Second International Symposium, SAGA 2003, Hatfield, UK, September 22-23, 2003. Proceedings

  • Andreas Albrecht
  • Kathleen Steinhöfel
Conference proceedings SAGA 2003

DOI: 10.1007/b13596

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

Table of contents

  1. Front Matter
  2. Roland Kirschner
    Pages 1-9
  3. Lucila Ohno-Machado, Winston Patrick Kuo
    Pages 39-49
  4. Osamu Watanabe, Takeshi Sawai, Hayato Takahashi
    Pages 50-60
  5. Benny Raphael, Ian F. C. Smith
    Pages 71-82
  6. John A. Vaccaro, Yasuyoshi Mitsumori, Stephen M. Barnett, Erika Andersson, Atsushi Hasegawa, Masahiro Takeoka et al.
    Pages 98-107
  7. Nikhil Devanur, Richard J. Lipton, Nisheeth Vishnoi
    Pages 108-116
  8. Roman A. Koryakin
    Pages 117-124
  9. Mike C. Bartholomew-Biggs, Steven C. Parkhurst, Simon P. Wilson
    Pages 125-137
  10. Alexander Chashkin
    Pages 146-156
  11. Back Matter

About these proceedings

Keywords

algorithms approximation automata calculus combinatorial optimization complexity constraint satisfaction data compression nondeterministic computation optimization randomization randomized local search simulated annealing stochastic algorithms stochastic learning

Editors and affiliations

  • Andreas Albrecht
    • 1
  • Kathleen Steinhöfel
    • 2
  1. 1.Science and Technology Research InstituteUniversity of HertfordshireHatfield, HertsUK
  2. 2.Department of Computer ScienceKing’s College LondonLondonUK

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2003
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-20103-8
  • Online ISBN 978-3-540-39816-5
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349