656 search results - page 44 / 132 » Complexity of finite-horizon Markov decision process problem... |
128
click to vote
ICASSP
2008
IEEE
15 years 8 months ago
2008
IEEE
This paper presents a new framework for accumulating beliefs in spoken dialogue systems. The technique is based on updating a Bayesian Network that represents the underlying state...
108
click to vote
ICML
2006
IEEE
16 years 2 months ago
2006
IEEE
How should a reinforcement learning agent act if its sole purpose is to efficiently learn an optimal policy for later use? In other words, how should it explore, to be able to exp...
116
click to vote
IJCAI
2007
15 years 3 months ago
2007
Markov Decision Processes are a powerful framework for planning under uncertainty, but current algorithms have difficulties scaling to large problems. We present a novel probabil...
147
click to vote
ICRA
2010
IEEE
15 years 13 days ago
2010
IEEE
— We consider the problem of task assignment and execution in multirobot systems, by proposing a procedure for bid estimation in auction protocols. Auctions are of interest to mu...
144
click to vote
FSTTCS
2010
Springer
14 years 12 months ago
2010
Springer
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...