Skip to main content
SpringerLink
Log in

Stochastic Algorithms: Foundations and Applications

Second International Symposium, SAGA 2003, Hatfield, UK, September 22-23, 2003, Proceedings

  • Conference proceedings
  • © 2003

Overview

Editors:
  1. Andreas Albrecht

    1. Science and Technology Research Institute, University of Hertfordshire, Hatfield, Herts, UK

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Kathleen Steinhöfel

    1. Department of Computer Science, King’s College London, London, UK

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 2827)

Included in the following conference series:

Conference proceedings info: SAGA 2003.

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (15 papers)

  1. Front Matter

    Download chapter PDF

  2. Prospects of Quantum Informatics

    • Roland Kirschner
    Pages 1-9

  3. A Converging ACO Algorithm for Stochastic Combinatorial Optimization

    • Walter J. Gutjahr
    Pages 10-25

  4. Optimality of Randomized Algorithms for the Intersection Problem

    • Jérémy Barbay
    Pages 26-38

  5. Stochastic Algorithms for Gene Expression Analysis

    • Lucila Ohno-Machado, Winston Patrick Kuo
    Pages 39-49

  6. Analysis of a Randomized Local Search Algorithm for LDPCC Decoding Problem

    • Osamu Watanabe, Takeshi Sawai, Hayato Takahashi
    Pages 50-60

  7. Testing a Simulated Annealing Algorithm in a Classification Problem

    • Karsten Luebke, Claus Weihs
    Pages 61-70

  8. Global Search through Sampling Using a PDF

    • Benny Raphael, Ian F. C. Smith
    Pages 71-82

  9. Simulated Annealing for Optimal Pivot Selection in Jacobian Accumulation

    • Uwe Naumann, Peter Gottschling
    Pages 83-97

  10. Quantum Data Compression

    • John A. Vaccaro, Yasuyoshi Mitsumori, Stephen M. Barnett, Erika Andersson, Atsushi Hasegawa, Masahiro Takeoka et al.
    Pages 98-107

  11. Who’sThe Weakest Link?

    • Nikhil Devanur, Richard J. Lipton, Nisheeth Vishnoi
    Pages 108-116

  12. On the Stochastic Open Shop Problem

    • Roman A. Koryakin
    Pages 117-124

  13. Global Optimization – Stochastic or Deterministic?

    • Mike C. Bartholomew-Biggs, Steven C. Parkhurst, Simon P. Wilson
    Pages 125-137

  14. Two-Component Traffic Modelled by Cellular Automata: Imposing Passing Restrictions on Slow Vehicles Increases the Flow

    • Paul Baalham, Ole Steuernagel
    Pages 138-145

  15. Average-Case Complexity of Partial Boolean Functions

    • Alexander Chashkin
    Pages 146-156

  16. Classes of Binary Rational Distributions Closed under Discrete Transformations

    • Roman Kolpakov
    Pages 157-166

  17. Back Matter

    Download chapter PDF
Back to top

Other volumes

  1. Stochastic Algorithms: Foundations and Applications

Keywords

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

Publish with us

Policies and ethics

Back to top

Search

Navigation