SMCtools 2007

PROGRAM

9.00-9.10 Opening

9.10-9.50 Invited Talk

Jane Hillston (University of Edinburgh)
Quantitative analysis of biochemical signalling pathways

9.50-10.30 Markov Decision Processes 1

Eitan Altman (INRIA), Saswati Sarkar (Univ of Pennsylvania), Eilon Solan (Tel-Aviv University)
Constrained Markov games with transition probabilities controlled by a single player

Jose Nino-Mora (Department of Statistics, Universidad Carlos III de Madrid)
Characterization and Computation of Restless Bandit Marginal Productivity Indices

10.30-10.50 Coffee Break

10.50-11.30 Markov Decision Processes 2

Joke Lambert (University of Antwerp), Benny Van Houdt (University of Antwerp), Chris Blondia (University of Antwerp)
A policy iteration algorithm for Markov decision processes skip-free in one direction

Jose Nino-Mora (Department of Statistics, Universidad Carlos III de Madrid)
Computing an Index Policy for Bandits with Switching Penalties

11.30-12.10 Tools

Markus Arns (University of Dortmund)
A Tool for the Analysis of Hierarchical Service-Oriented Extended Open Fork/Join Queueing Networks

Markus Siegle (Univ. of the Federal Armed Forces Germany), Stefan Harwarth (Univ. of the Federal Armed Forces Germany), Kai Lampka (Univ. of the Federal Armed Forces Germany)
Can matrix-layout-independent numerical solvers be efficient?

12.10-12.30 Phase Type Distributions

Andras Horvath (University of Turin, Dept. of Informatics), Miklos Telek (Dept.of Telecommunications, Technical University of Budapest)
On the Properties of Acyclic Bilateral Phase Type Distributions

12.30-14.00 Lunch

14.00-15.00 Applications

Gerhard Hasslinger (T-Systems Enterprise Systems), Sebastian Kempken (University of Duisburg-Essen, Dept. of Cumputer Science)
Efficiency of random walks for search in different network structures

Juha Leino (Networking Laboratory, Helsinki University)
Approximating Optimal Load Balancing Policy in Discriminatory Processor Sharing Systems

Konstantin Avrachenkov (INRIA Sophia Antipolis), Danil Nemirovsky (INRIA Sophia Antipolis and St.Petersburg State University), Son Pham (St.Petersburg State University)
A survey on distributed approaches to graph based reputation measures

15.10-15.40 Stochastic Automata Networks

Ricardo Czekster (PUCRS), Paulo Fernandes (PUCRS-CNPq), Jean-Marc Vincent (Laboratoire LIG - Project MESCAL), Thais Webber (PUCRS)
Split: a flexible and efficient algorithm to vector-descriptor product

Jean-Michel Fourneau (Laboratoire Informatique de Grenoble and PRiSM, University of Versailles)
Discrete Time Stochastic Automata Networks: using structural properties and stochastic bounds to simplify the SAN

15.40-16.00 Closing Session