Sciweavers

27 search results - page 2 / 6
» fsttcs 2006
Sort
View
FSTTCS
2006
Springer
13 years 8 months ago
Almost Optimal Strategies in One Clock Priced Timed Games
We consider timed games extended with cost information, and prove computability of the optimal cost and of -optimal memoryless strategies in timed games with one clock. In contrast...
Patricia Bouyer, Kim Guldstrand Larsen, Nicolas Ma...
FSTTCS
2006
Springer
13 years 8 months ago
Unbiased Rounding of Rational Matrices
Rounding a real-valued matrix to an integer one such that the rounding errors in all rows and columns are less than one is a classical problem. It has been applied to hypergraph co...
Benjamin Doerr, Christian Klein
FSTTCS
2006
Springer
13 years 8 months ago
On Reduction Criteria for Probabilistic Reward Models
In recent papers, the partial order reduction approach has been adapted to reason about the probabilities for temporal properties in concurrent systems with probabilistic behaviour...
Marcus Größer, Gethin Norman, Christel ...
FSTTCS
2006
Springer
13 years 8 months ago
Approximation Algorithms for 2-Stage Stochastic Optimization Problems
Abstract. Stochastic optimization is a leading approach to model optimization problems in which there is uncertainty in the input data, whether from measurement noise or an inabili...
Chaitanya Swamy, David B. Shmoys
FSTTCS
2006
Springer
13 years 8 months ago
Testing Probabilistic Equivalence Through Reinforcement Learning
We propose a new approach to verification of probabilistic processes for which the model may not be available. We use a technique from Reinforcement Learning to approximate how far...
Josee Desharnais, François Laviolette, Sami...