Verkäufer
Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
AbeBooks-Verkäufer seit 25. März 2015
In. Bestandsnummer des Verkäufers ria9783540430254_new
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.
Reseña del editor: 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.
Titel: Stochastic Algorithms: Foundations and ...
Verlag: Springer
Erscheinungsdatum: 2001
Einband: Softcover
Zustand: New
Anbieter: Universitätsbuchhandlung Herta Hold GmbH, Berlin, Deutschland
VIII, 202 p. Softcover. Versand aus Deutschland / We dispatch from Germany via Air Mail. Einband bestoßen, daher Mängelexemplar gestempelt, sonst sehr guter Zustand. Imperfect copy due to slightly bumped cover, apart from this in very good condition. Stamped. Lecture Notes in Computer Science, Vol. 2264. Sprache: Englisch. Artikel-Nr. 641EB
Anzahl: 1 verfügbar
Anbieter: moluna, Greven, Deutschland
Zustand: New. Artikel-Nr. 4890197
Anzahl: Mehr als 20 verfügbar
Anbieter: preigu, Osnabrück, Deutschland
Taschenbuch. Zustand: Neu. Stochastic Algorithms: Foundations and Applications | International Symposium, SAGA 2001 Berlin, Germany, December 13-14, 2001 Proceedings | Kathleen Steinhöfel | Taschenbuch | ccxvi | Englisch | 2001 | Springer | EAN 9783540430254 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Artikel-Nr. 103834618
Anzahl: 5 verfügbar
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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. Artikel-Nr. 9783540430254
Anzahl: 1 verfügbar