Lecture Notes in Computer Science

Stochastic Algorithms: Foundations and Applications

International Symposium, SAGA 2001 Berlin, Germany, December 13-14, 2001 Proceedings

Editors: Steinhöfel, Kathleen (Ed.)

Buy this book

eBook $59.99
price for USA (gross)
  • ISBN 978-3-540-45322-2
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $79.99
price for USA
  • ISBN 978-3-540-43025-4
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
About this book

SAGA 2001, the ?rst Symposium on Stochastic Algorithms, Foundations and Applications, took place on December 13–14, 2001 in Berlin, Germany. The present volume comprises contributed papers and four invited talks that were included in the ?nal program of the symposium. Stochastic algorithms constitute a general approach to ?nding approximate solutions to a wide variety of problems. Although there is no formal proof that stochastic algorithms perform better than deterministic ones, there is evidence by empirical observations that stochastic algorithms produce for a broad range of applications near-optimal solutions in a reasonable run-time. The symposium aims to provide a forum for presentation of original research in the design and analysis, experimental evaluation, and real-world application of stochastic algorithms. It focuses, in particular, on new algorithmic ideas invo- ing stochastic decisions and exploiting probabilistic properties of the underlying problem domain. The program of the symposium re?ects the e?ort to promote cooperation among practitioners and theoreticians and among algorithmic and complexity researchers of the ?eld. In this context, we would like to express our special gratitude to DaimlerChrysler AG for supporting SAGA 2001. The contributed papers included in the proceedings present results in the following areas: Network and distributed algorithms; local search methods for combinatorial optimization with application to constraint satisfaction problems, manufacturing systems, motor control unit calibration, and packing ?exible - jects; and computational learning theory.

Table of contents (2 chapters)

  • Yet Another Local Search Method for Constraint Solving

    Philippe Codognet, Daniel Diaz

    Pages 73-90

  • Evolutionary Search for Smooth Maps in Motor Control Unit Calibration

    Jan Poland, Kosmas Knödler, Alexander Mitterer, et al.

    Pages 107-116

Buy this book

eBook $59.99
price for USA (gross)
  • ISBN 978-3-540-45322-2
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Softcover $79.99
price for USA
  • ISBN 978-3-540-43025-4
  • Free shipping for individuals worldwide
  • Usually dispatched within 3 to 5 business days.
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Stochastic Algorithms: Foundations and Applications
Book Subtitle
International Symposium, SAGA 2001 Berlin, Germany, December 13-14, 2001 Proceedings
Editors
  • Kathleen Steinhöfel
Series Title
Lecture Notes in Computer Science
Series Volume
2264
Copyright
2001
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-540-45322-2
DOI
10.1007/3-540-45322-9
Softcover ISBN
978-3-540-43025-4
Series ISSN
0302-9743
Edition Number
1
Number of Pages
CCXVI, 208
Topics