2. SAGA 2003: Hatfield, UK

@proceedings{DBLP:conf/saga/2003,
  editor    = {Andreas Alexander Albrecht and
               Kathleen Steinh{\"o}fel},
  title     = {Stochastic Algorithms: Foundations and Applications, Second International
               Symposium, SAGA 2003, Hatfield, UK, September 22-23, 2003, Proceedings},
  booktitle = {SAGA},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {2827},
  year      = {2003},
  isbn      = {3-540-20103-3},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

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

Last update Tue Feb 14 04:10:06 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page