Sciweavers

683 search results - page 109 / 137
» Coarticulation in Markov Decision Processes
Sort
View
FSTTCS
2010
Springer
13 years 7 months ago
One-Counter Stochastic Games
We study the computational complexity of basic decision problems for one-counter simple stochastic games (OC-SSGs), under various objectives. OC-SSGs are 2-player turn-based stoch...
Tomás Brázdil, Václav Brozek,...
ICPR
2004
IEEE
14 years 10 months ago
Complex Human Activity Recognition for Monitoring Wide Outdoor Environments
The problem of automatic recognition of human activities is among the most important and challenging open areas of research in Computer Vision. This paper presents a new approach ...
Arcangelo Distante, I. Gnoni, Marco Leo, Paolo Spa...
ICML
2009
IEEE
14 years 9 months ago
Predictive representations for policy gradient in POMDPs
We consider the problem of estimating the policy gradient in Partially Observable Markov Decision Processes (POMDPs) with a special class of policies that are based on Predictive ...
Abdeslam Boularias, Brahim Chaib-draa
ICML
2007
IEEE
14 years 9 months ago
Learning state-action basis functions for hierarchical MDPs
This paper introduces a new approach to actionvalue function approximation by learning basis functions from a spectral decomposition of the state-action manifold. This paper exten...
Sarah Osentoski, Sridhar Mahadevan
ICML
2007
IEEE
14 years 9 months ago
Conditional random fields for multi-agent reinforcement learning
Conditional random fields (CRFs) are graphical models for modeling the probability of labels given the observations. They have traditionally been trained with using a set of obser...
Xinhua Zhang, Douglas Aberdeen, S. V. N. Vishwanat...