Stochastic Algorithms - Foundations and Applications

This book constitutes the refereed proceedings of the Second International Symposium on Stochastic Algorithms: Foundations and Applications, SAGA 2003, held in Hatfield, UK in September 2003. The 12 revised full papers presented together with three invited papers were carefully reviewed and selected for inclusion in the book. Among the topics addressed are ant colony optimization, randomized algorithms for the intersection problem, local search for constraint satisfaction problems, randomized local search and combinatorial optimization, simulated annealing, probabilistic global search, network communication complexity, open shop scheduling, aircraft routing, traffic control, randomized straight-line programs, and stochastic automata and probabilistic transformations.

ISBN 3540201033   Weight (grammes) 590 ISBN13 9783540201038 (What's this?)   Published in Berlin Publisher Springer-Verlag Berlin and Heidelberg GmbH & Co. KG   Conference location Hatfield, UK Imprint Springer-Verlag Berlin and Heidelberg GmbH & Co. K   Conference name SAGA 2003 Format Paperback   Conference year 2003 Publication date 16 Sep 2003   Series ISSN 2827 Library of Congress 2003058765   Series title Lecture Notes in Computer Science DEWEY 518.1   Height (mm) 234 DEWEY edition DC22   Width (mm) 156 Pages 184   Spine width (mm) 9 Volumes 1   Academic level Tertiary education, Undergraduate, Postgraduate, Professional / Scholarly

		Prospects of Quantum Informatics by Roland Kirschner		1
		A Converging ACO Algorithm for Stochastic Combinatorial Optimization by Walter J. Gutjahr		10
		Optimality of Randomized Algorithms for the Intersection Problem by Jeremy Barbay		26
		Stochastic Algorithms for Gene Expression Analysis by Lucila Ohno-Machado and Winston Patrick Kuo		39
		Analysis of a Randomized Local Search Algorithm for LDPCC Decoding Problem by Osamu Watanabe and Takeshi Sawai and Hayato Takahashi		50
		Testing a Simulated Annealing Algorithm in a Classification Problem by Karsten Luebke and Claus Weihs		61
		Global Search through Sampling Using a PDF by Benny Raphael and Ian F. C. Smith		71
		Simulated Annealing for Optimal Pivot Selection in Jacobian Accumuation by Uwe Naumann and Peter Gottschling		83
		Quantum Data Compression by John A. Vaccaro and Yasuyoshi Mitsumori and Stephen M. Barnett and Erika Andersson and Atsushi Hasegawa and Masahiro Takeoka and Masahide Sasaki		98
		Who's The Weakest Link? by Nikhil Devanur and Richard J. Lipton and Nisheeth Vishnoi		108
		On the Stochastic Open Shop Problem by Roman A. Koryakin		117
		Global Optimization - Stochastic or Deterministic? by Mike C. Bartholomew-Biggs and Steven C. Parkhurst and Simon P. Wilson		125
		Two-Component Traffic Modelled by Cellular Automata: Imposing Passing Restrictions on Slow Vehicles Increases the Flow by Paul Baalham and Ole Steuernagel		138
		Average-Case Complexity of Partial Boolean Functions by Alexander Chashkin		146
		Classes of Binary Rational Distributions Closed under Discrete Transformations by Roman Kolpakov		157
		Author Index		167

 Be the first to write a customer review