Blick ins Buch

Stochastic Algorithms: Foundations and Applications

Second International Symposium, SAGA 2003, Hatfield, UK, September 22-23, 2003, Proceedings. Sprachen: Englisch. 23,5 cm / 15,5 cm / 1,1 cm ( B/H/T )
Buch (Softcover), 184 Seiten
EAN 9783540201038
Veröffentlicht September 2003
Verlag/Hersteller Springer

Auch erhältlich als:

eBook (pdf)
53,49
53,49 inkl. MwSt.
Lieferbar innerhalb von 2-3 Tagen (Versand mit Deutscher Post/DHL)
Teilen
Beschreibung

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.

Inhaltsverzeichnis

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.

Hersteller
Springer-Verlag GmbH
Tiergartenstr. 17

DE - 69121 Heidelberg

E-Mail: ProductSafety@springernature.com