2005 search results - page 200 / 401 » Decisive Markov Chains |
116
click to vote
IJCAI
2001
15 years 3 months ago
2001
We present a dynamic programming approach for the solution of first-order Markov decisions processes. This technique uses an MDP whose dynamics is represented in a variant of the ...
75
Voted
NIPS
2004
15 years 3 months ago
2004
We introduce a new algorithm based on linear programming that approximates the differential value function of an average-cost Markov decision process via a linear combination of p...
AAAI
1994
15 years 3 months ago
1994
In this paper, we describe the partially observable Markov decision process pomdp approach to nding optimal or near-optimal control strategies for partially observable stochastic ...
113
click to vote
ML
2002
ACM
15 years 1 months ago
2002
ACM
We present new algorithms for reinforcement learning, and prove that they have polynomial bounds on the resources required to achieve near-optimal return in general Markov decisio...
147
click to vote
ICRA
2010
IEEE
15 years 8 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...