Sciweavers

163 search results - page 7 / 33
» Solving Simple Stochastic Games
Sort
View
110
Voted
CORR
2010
Springer
79views Education» more  CORR 2010»
15 years 2 months ago
Quantitative Games on Probabilistic Timed Automata
Abstract. Two-player zero-sum games are a well-established model for synthesising controllers that optimise some performance criterion. In such games one player represents the cont...
Marta Z. Kwiatkowska, Gethin Norman, Ashutosh Triv...
135
Voted
ICALP
2007
Springer
15 years 9 months ago
Continuous Capacities on Continuous State Spaces
We propose axiomatizing some stochastic games, in a continuous state space setting, using continuous belief functions, resp. plausibilities, instead of measures. Then, stochastic g...
Jean Goubault-Larrecq
165
Voted
FORMATS
2010
Springer
15 years 24 days ago
Combining Symbolic Representations for Solving Timed Games
We present a general approach to combine symbolic state space representations for the discrete and continuous parts in the synthesis of winning strategies for timed reachability ga...
Rüdiger Ehlers, Robert Mattmüller, Hans-...
129
Voted
ASC
2004
15 years 2 months ago
Solving nonconvex climate control problems: pitfalls and algorithm performances
Global optimization can be used as the main component for reliable decision support systems. In this contribution, we explore numerical solution techniques for nonconvex and nondi...
Carmen G. Moles, Julio R. Banga, Klaus Keller
117
Voted
GECCO
2003
Springer
201views Optimization» more  GECCO 2003»
15 years 8 months ago
Solving Mastermind Using Genetic Algorithms
The MasterMind game involves decoding a secret code. The classic game is a code of six possible colors in four slots. The game has been analyzed and optimal strategies have been po...
Tom Kalisker, Doug Camens