656 search results - page 7 / 132 » Complexity of finite-horizon Markov decision process problem... |
100
click to vote
HCI
2009
14 years 9 months ago
2009
Sign language (SL) recognition modules in human-computer interaction systems need to be both fast and reliable. In cases where multiple sets of features are extracted from the SL d...
110
click to vote
ICML
2006
IEEE
16 years 16 days ago
2006
IEEE
Recent decision-theoric planning algorithms are able to find optimal solutions in large problems, using Factored Markov Decision Processes (fmdps). However, these algorithms need ...
103
click to vote
ORL
2008
14 years 11 months ago
2008
The unichain classification problem detects whether a finite state and action MDP is unichain under all deterministic policies. This problem is NP-hard [11]. This paper provides p...
ATAL
2008
Springer
15 years 1 months ago
2008
Springer
Meta-level control manages the allocation of limited resources to deliberative actions. This paper discusses efforts in adding meta-level control capabilities to a Markov Decision...
LICS
2009
IEEE
15 years 6 months ago
2009
IEEE
—We associate a statistical vector to a trace and a geometrical embedding to a Markov Decision Process, based on a distance on words, and study basic Membership and Equivalence p...