350 search results - page 25 / 70 » On Strategy Improvement Algorithms for Simple Stochastic Gam... |
ASC
2004
14 years 9 months ago
2004
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...
SODA
2010
ACM
15 years 7 months ago
2010
ACM
The class of constraint satisfactions problems (CSPs) captures many fundamental combinatorial optimization problems such as Max Cut, Max q-Cut, Unique Games, and Max k-Sat. Recent...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We consider games played on finite graphs, whose goal is to obtain a trace belonging to a given set of winning traces. We focus on those states from which Player 1 cannot force a w...
131
click to vote
AIIDE
2009
14 years 10 months ago
2009
Dynamic scripting is a reinforcement learning algorithm designed specifically to learn appropriate tactics for an agent in a modern computer game, such as Neverwinter Nights. This...
ICAISC
2004
Springer
15 years 2 months ago
2004
Springer
Model checking of temporal logic has already been proposed for automatic planning. In this paper, we introduce a simple adaptation of the ATL model checking algorithm that returns ...