|
SAGA 2009 Conference Program |
|
|
Monday, October 26, 2009 |
13:30-14:30: Invited Lecture
Taisuke Sato
Statistical Learning of Probabilistic BDDs
|
|
14:30-15:00: Coffee Break
|
15:00-17:00:
Session 1: Testing, Optimization, and Caching
|
Andrea Arcuri
Theoretical Analysis of Local Search in Software Testing
|
Charles Jordan and Thomas Zeugmann
Relational Properties Expressible with One Universal Quantifier Are
Testable
|
Xin-She Yang
Firefly Algorithms for Multimodal Optimization
|
Matthias Englert, Berthold Vöcking, and Melanie Winkler
Economical Caching With Stochastic Prices
|
|
|
Tuesday, October 27, 2009 |
9:30-12:00:
Session 2: Learning
|
Vladimir V. V'yugin
Learning Volatility of Discrete Time Series Using Prediction
with Expert Advice
|
Mikhail Dashevskiy and Zhiyuan Luo
Prediction of Long-Range Dependent Time Series Data with Performance Guarantee
|
Kazuya Haraguchi, Seok-Hee Hong, and Hiroshi Nagamochi
Bipartite Graph Representation of Multiple Decision Table Classifiers
|
Boris Defourny, Damien Ernst, and Louis Wehenkel
Bounds for Multistage Stochastic Programming Using Supervised Learning Strategies
|
|
Dimitrios I. Diochnos and György Turán
On Evolvability: The Swapping Algorithm, Product Distributions, and Covariance
|
|
14:30-15:00: Lunch Break
|
13:30-14:30: Invited Lecture
Werner Römisch
Scenario Reduction Techniques in Stochastic Programming
|
|
14:30-15:00: Coffee Break
|
|
15:00-17:00: Excursion
|
|
18:00-20:00: Banquet
|
|
|
Wednesday, October 28, 2009 |
9:30-10:30:
Session 3: Stochastic Algorithms in Bioinformatics
|
C. Grills, D. A. Fennell, and S. F. C. Shearer
Markov Modelling of Mitochondrial BAK Activation Kinetics During Apoptosis
|
S. F. C. Shearer, S. Sahoo, and A. Sahoo
Stochastic Dynamics of Logistic Tumor Growth
|
|
10:30-11:00: Coffee Break
|
11:00-13:00:
Session 4: Graphs
|
Ei Ando, Hirotaka Ono, and Masafumi Yamashita
A Generic Algorithm for Approximately Solving Stochastic
Graph Optimization Problems
|
Yoshiaki Nonaka, Hirotaka Ono, Kunihiko Sadakane, and Masafumi Yamashita
How to Design a Linear Cover Time Random Walk on a Finite Graph
|
Robert Berke and Mikael Onsjö
Propagation Connectivity of Random Hypergraphs
|
Yakir Berchenko and Mina Teicher
Graph Embedding Through Random Walk for Shortest Paths Problems
|
