Stochastic Algorithms: Foundations and Applications

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

  • Kathleen Steinhöfel
Conference proceedings SAGA 2001

DOI: 10.1007/3-540-45322-9

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

Table of contents

  1. Front Matter
    Pages I-VIII
  2. Juraj Hromkovič
    Pages 1-32
  3. Martin Sauerho.
    Pages 65-72
  4. Philippe Codognet, Daniel Diaz
    Pages 73-90
  5. Jan Poland, Kosmas Knödler, Alexander Mitterer, Thomas Fleischhauer, Frank Zuber-Goos, Andreas Zell
    Pages 107-116
  6. Gregory B. Sorkin
    Pages 117-130
  7. Henning Behnke, Michael Kolonko, Ulrich Mertins, Stefan Schnitter
    Pages 145-154
  8. Thomas Zeugmann
    Pages 155-172
  9. Ricard Gavaldà, Osamu Watanabe
    Pages 173-188
  10. Back Matter
    Pages 203-203

About these proceedings

Introduction

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.

Keywords

Erfüllbarkeitsproblem der Aussagenlogik Stochastic algorithms Variable algorithms approximation calculus complexity constraint satisfaction evolutionary algorithm nondeterministic computation optimization randomization randomized communication randomized computation stochastic learning

Editors and affiliations

  • Kathleen Steinhöfel
    • 1
  1. 1.Institute for Computer Architecture and Software EngineeringGMD - National ResearchCenter for Information TechnologyBerlin-AdlershofGermany

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2001
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-43025-4
  • Online ISBN 978-3-540-45322-2
  • Series Print ISSN 0302-9743