Logo - springer
Slogan - springer

Mathematics - Probability Theory and Stochastic Processes | Stochastic Algorithms: Foundations and Applications - International Symposium, SAGA 2001 Berlin,

Stochastic Algorithms: Foundations and Applications

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

Steinhöfel, Kathleen (Ed.)

2001, CCXVI, 208 p.

Available Formats:

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.


(net) price for USA

ISBN 978-3-540-45322-2

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase

learn more about Springer eBooks

add to marked items


Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.


(net) price for USA

ISBN 978-3-540-43025-4

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days

add to marked items

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.

Content Level » Research

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

Related subjects » Probability Theory and Stochastic Processes - Theoretical Computer Science

Table of contents / Sample pages 

Popular Content within this publication 



Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Probability Theory and Stochastic Processes.