| 书目名称 | Stochastic Algorithms: Foundations and Applications |
| 副标题 | International Sympos |
| 编辑 | Kathleen Steinhöfel |
| 视频video | |
| 概述 | Includes supplementary material: |
| 丛书名称 | Lecture Notes in Computer Science |
| 图书封面 |  |
| 描述 | 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 ou |
| 出版日期 | Conference proceedings 2001 |
| 关键词 | Erfüllbarkeitsproblem der Aussagenlogik; Stochastic algorithms; Variable; algorithms; approximation; calc |
| 版次 | 1 |
| doi | https://doi.org/10.1007/3-540-45322-9 |
| isbn_softcover | 978-3-540-43025-4 |
| isbn_ebook | 978-3-540-45322-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 |
| issn_series | 0302-9743 |
| copyright | Springer-Verlag Berlin Heidelberg 2001 |
发表于 2025-3-21 20:02:43
