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.
"synopsis" may belong to another edition of this title.
US$ 33.69 shipping from Germany to U.S.A.
Destination, rates & speedsSeller: Universitätsbuchhandlung Herta Hold GmbH, Berlin, Germany
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. Seller Inventory # 641EB
Quantity: 1 available
Seller: GuthrieBooks, Spring Branch, TX, U.S.A.
Paperback. Condition: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments. Seller Inventory # DA1411499
Quantity: 1 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New. Seller Inventory # 916306-n
Quantity: Over 20 available
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Condition: New. Seller Inventory # ABLIING23Mar3113020167362
Quantity: Over 20 available
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition. Seller Inventory # 916306
Quantity: Over 20 available
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Condition: New. In. Seller Inventory # ria9783540430254_new
Quantity: Over 20 available
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 216 pp. Englisch. Seller Inventory # 9783540430254
Quantity: 2 available
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Condition: New. Seller Inventory # 916306-n
Quantity: Over 20 available
Seller: Chiron Media, Wallingford, United Kingdom
PF. Condition: New. Seller Inventory # 6666-IUK-9783540430254
Quantity: 10 available
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: 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. Seller Inventory # 9783540430254
Quantity: 1 available