Übersicht			Auf mobile öffnen

Lieferstatus:	i.d.R. innert 5-10 Tagen versandfertig
Veröffentlichung:	Dezember 2001
Genre:	EDV / Informatik
	Algorithm Analysis and Problem Complexity / Algorithms / Algorithms & data structures / C / Combinatorics / Combinatorics & graph theory / Computation by Abstract Devices / computer science / Computer science—Mathematics / Computers / Discrete Mathematics / Discrete Mathematics in Computer Science / Mathematical & statistical software / Mathematical statistics / Maths for computer scientists / Probabilities / Probability and Statistics in Computer Science / Probability Theory / Probability Theory and Stochastic Processes / Stochastics / Theory of Computation
ISBN:	9783540430254
EAN-Code:	9783540430254
Verlag:	Springer Berlin Heidelberg
Einband:	Kartoniert
Sprache:	English
Serie:	#2264 - Lecture Notes in Computer Science
Dimensionen:	H 235 mm / B 155 mm / D 12 mm
Gewicht:	335 gr
Seiten:	216
Zus. Info:	Paperback
Bewertung:	Titel bewerten / Meinung schreiben

Inhalt:

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.