Cantitate/Preț
Produs
Total produse
Vezi coșul
Stochastic Algorithms: Foundations and Applications: 5th International Symposium, SAGA 2009 Sapporo, Japan, October 26-28, 2009 Proceedings de Osamu Watanabe

Stochastic Algorithms: Foundations and Applications: 5th International Symposium, SAGA 2009 Sapporo, Japan, October 26-28, 2009 Proceedings: Lecture Notes in Computer Science, cartea 5792

Editat de Osamu Watanabe, Thomas Zeugmann
en Limba Engleză Paperback – 5 oct 2009
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 33042 lei

Preț vechi: 41303 lei
-20% Nou

Puncte Express: 496
Preț estimativ în valută:
6323€ • 6562$ • 5285£

Carte tipărită la comandă

Livrare economică 18 martie-01 aprilie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783642049439
ISBN-10: 3642049435
Pagini: 232
Ilustrații: X, 221 p.
Dimensiuni: 155 x 235 x 15 mm
Greutate: 0.36 kg
Ediția:2009
Editura: Springer Berlin, Heidelberg
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.

Textul de pe ultima copertă

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.