Stochastic algorithms : foundations and applications : second international symposium, SAGA 2003, Hatfield, UK, September 22-23, 2003 : proceedings

Đã lưu trong:
Chi tiết về thư mục
Tác giả của công ty: Symposium on Stochastic Algorithms, Foundations and Applications :Hatfield, GB
Tác giả khác: Albrecht, Andreas, 1951-...., écrivain (Giám đốc xuất bản), Steinhofel, Kathleen, 19..- (Giám đốc xuất bản)
Định dạng: Livre numérique
Ngôn ngữ:Anglais
Được phát hành: Berlin [etc.] : Springer [20..].
Cham : Springer Nature
Loạt:Lecture notes in computer science 2827
Những chủ đề:
Truy cập trực tuyến:Accès sur la plateforme de l'éditeur
Accès sur la plateforme Istex
Accès Université d'Orléans
Accès INSA CVL
Chú thích: Archives Springer e-books (Licence nationale)
Archives Springer e-books (Licence nationale)
Autres localisations: Voir dans le Sudoc
Edition sous un autre format:• Stochastic algorithms, foundations and applications, second international symposium, SAGA 2003, Hatfield, UK, September 22-23, 2003, proceedings, Andreas Albrecht, Kathleen Steinhöfel (eds.), Berlin, Springer, 2003, 1 vol. (VIII-166 p.), Lecture notes in computer science, 3-540-20103-3
• Stochastic Algorithms: Foundations and Applications, Texte imprimé, 9783662190586
Mục lục:
  • Prospects of Quantum Informatics
  • A Converging ACO Algorithm for Stochastic Combinatorial Optimization
  • Optimality of Randomized Algorithms for the Intersection Problem
  • Stochastic Algorithms for Gene Expression Analysis
  • Analysis of a Randomized Local Search Algorithm for LDPCC Decoding Problem
  • Testing a Simulated Annealing Algorithm in a Classification Problem
  • Global Search through Sampling Using a PDF
  • Simulated Annealing for Optimal Pivot Selection in Jacobian Accumulation
  • Quantum Data Compression
  • Who sThe Weakest Link?
  • On the Stochastic Open Shop Problem
  • Global Optimization Stochastic or Deterministic?
  • Two-Component Traffic Modelled by Cellular Automata: Imposing Passing Restrictions on Slow Vehicles Increases the Flow
  • Average-Case Complexity of Partial Boolean Functions
  • Classes of Binary Rational Distributions Closed under Discrete Transformations.