Editors:
Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2827)
Conference series link(s): SAGA: International Symposium on Stochastic Algorithms
Conference proceedings info: SAGA 2003.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsThis is a preview of subscription content, access via your institution.
Table of contents (15 papers)
-
Front Matter
-
Back Matter
Keywords
- algorithms
- approximation
- automata
- calculus
- combinatorial optimization
- complexity
- constraint satisfaction
- data compression
- nondeterministic computation
- optimization
- randomization
- randomized local search
- simulated annealing
- stochastic algorithms
- stochastic learning
- algorithm analysis and problem complexity
Editors and Affiliations
-
Science and Technology Research Institute, University of Hertfordshire, Hatfield, Herts, UK
Andreas Albrecht
-
Department of Computer Science, King’s College London, London, UK
Kathleen Steinhöfel
Bibliographic Information
Book Title: Stochastic Algorithms: Foundations and Applications
Book Subtitle: Second International Symposium, SAGA 2003, Hatfield, UK, September 22-23, 2003, Proceedings
Editors: Andreas Albrecht, Kathleen Steinhöfel
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/b13596
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 2003
Softcover ISBN: 978-3-540-20103-8Published: 16 September 2003
eBook ISBN: 978-3-540-39816-5Published: 20 November 2003
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: VIII, 172
Topics: Probability Theory, Algorithms, Theory of Computation, Numerical Analysis, Discrete Mathematics in Computer Science, Probability and Statistics in Computer Science