771 search results - page 49 / 155 » Markov Decision Processes with Arbitrary Reward Processes |
121
click to vote
FGR
2006
IEEE
15 years 8 months ago
2006
IEEE
We present a novel tracking algorithm that uses dynamic programming to determine the path of target objects and that is able to track an arbitrary number of different objects. The...
142
click to vote
IJCAI
2001
15 years 3 months ago
2001
Although a partially observable Markov decision process (POMDP) provides an appealing model for problems of planning under uncertainty, exact algorithms for POMDPs are intractable...
140
click to vote
IWQOS
2011
Springer
14 years 4 months ago
2011
Springer
In this paper, we address the problem of providing a service broker, which offers to prospective users a composite service with a range of different Quality of Service (QoS) class...
102
click to vote
AIPS
2007
15 years 4 months ago
2007
Several researchers have shown that the efficiency of value iteration, a dynamic programming algorithm for Markov decision processes, can be improved by prioritizing the order of...
144
click to vote
AAAI
2012
13 years 4 months ago
2012
Markov decision processes (MDPs) are an established framework for solving sequential decision-making problems under uncertainty. In this work, we propose a new method for batchmod...