1599 search results - page 218 / 320 » Algorithms for Parity Games |
191
click to vote
AAAI
2012
13 years 8 months ago
2012
We introduce a new task-independent framework to model top-down overt visual attention based on graphical models for probabilistic inference and reasoning. We describe a Dynamic B...
156
click to vote
PAAMS
2010
Springer
15 years 11 months ago
2010
Springer
In this paper, we introduce a new heuristic search algorithm based on mean values for anytime planning, called MHSP. It consists in associating the principles of UCT, a bandit-base...
153
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
—We consider an agent interacting with an unmodeled environment. At each time, the agent makes an observation, takes an action, and incurs a cost. Its actions can influence futu...
159
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
We investigate methods for planning in a Markov Decision Process where the cost function is chosen by an adversary after we fix our policy. As a running example, we consider a rob...
164
click to vote
COLT
2004
Springer
15 years 11 months ago
2004
Springer
: We introduce a graph-theoretic generalization of classical Arrow-Debreu economics, in which an undirected graph specifies which consumers or economies are permitted to engage in...