Zum Hauptinhalt springen

Stochastic Algorithms: Foundations and Applications

5th International Symposium, SAGA 2009 Sapporo, Japan, October 26-28, 2009 Proceedings
Buch | Softcover
X, 221 Seiten
2009
Springer Berlin (Verlag)
978-3-642-04943-9 (ISBN)
74,89 inkl. MwSt
This book constitutes the refereed proceedings of the 5th International Symposium on Stochastic Algorithms, Foundations and Applications, SAGA 2009, held in Sapporo, Japan, in October 2009. The 15 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 22 submissions. The papers are organized in topical sections on learning, graphs, testing, optimization and caching, as well as stochastic algorithms in bioinformatics.

Invited Papers.- Scenario Reduction Techniques in Stochastic Programming.- Statistical Learning of Probabilistic BDDs.- Regular Contributions.- Learning Volatility of Discrete Time Series Using Prediction with Expert Advice.- Prediction of Long-Range Dependent Time Series Data with Performance Guarantee.- Bipartite Graph Representation of Multiple Decision Table Classifiers.- Bounds for Multistage Stochastic Programs Using Supervised Learning Strategies.- On Evolvability: The Swapping Algorithm, Product Distributions, and Covariance.- A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems.- How to Design a Linear Cover Time Random Walk on a Finite Graph.- Propagation Connectivity of Random Hypergraphs.- Graph Embedding through Random Walk for Shortest Paths Problems.- Relational Properties Expressible with One Universal Quantifier Are Testable.- Theoretical Analysis of Local Search in Software Testing.- Firefly Algorithms for Multimodal Optimization.- Economical Caching with Stochastic Prices.- Markov Modelling of Mitochondrial BAK Activation Kinetics during Apoptosis.- Stochastic Dynamics of Logistic Tumor Growth.

Erscheint lt. Verlag 5.10.2009
Reihe/Serie Lecture Notes in Computer Science
Theoretical Computer Science and General Issues
Zusatzinfo X, 221 p.
Verlagsort Berlin
Sprache englisch
Maße 155 x 235 mm
Themenwelt Mathematik / Informatik Informatik Theorie / Studium
Schlagworte Algorithm analysis and problem complexity • algorithms • Approximation • Bioinformatics • Complexity • counting algorithm • data structures • dynamical-probability • Evolution • evolutionary algorithms • Genetic algorithms • Graph • graph embedding • Hardcover, Softcover / Informatik, EDV/Informatik • learning • Normal distribution • Optimization • probabilistic techniques • property testing • Randomization • randomized computation • randomized local search • shortest paths problem • Simulated annealing • Stochastic algorithms • stochastic learning • stochastic optimization problem
ISBN-10 3-642-04943-5 / 3642049435
ISBN-13 978-3-642-04943-9 / 9783642049439
Zustand Neuware
Informationen gemäß Produktsicherheitsverordnung (GPSR)
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Teil 2 der gestreckten Abschlussprüfung Fachinformatiker/-in …

von Dirk Hardy; Annette Schellenberg; Achim Stiefel

Buch | Softcover (2025)
Europa-Lehrmittel (Verlag)
25,30
Visionärin und Genie

von Vera Weidenbach

Buch | Hardcover (2025)
Rowohlt (Verlag)
24,00