771 search results - page 95 / 155 » Markov Decision Processes with Arbitrary Reward Processes |
140
click to vote
AIPS
1998
15 years 5 months ago
1998
Planning methods for deterministic planning problems traditionally exploit factored representations to encode the dynamics of problems in terms of a set of parameters, e.g., the l...
137
click to vote
SBMF
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. In the verification of concurrent systems involving probabilities, the aim is to find out the maximum/minimum probability that a given event occurs (examples of such ev...
123
click to vote
TSP
2010
14 years 10 months ago
2010
Abstract--In this paper, we consider a competitive approach to sequential decision problems, suitable for a variety of signal processing applications where at each of a succession ...
163
click to vote
UAI
2000
15 years 5 months ago
2000
We consider the problem belief-state monitoring for the purposes of implementing a policy for a partially-observable Markov decision process (POMDP), specifically how one might ap...
124
click to vote
JMLR
2010
14 years 10 months ago
2010
We consider reinforcement learning as solving a Markov decision process with unknown transition distribution. Based on interaction with the environment, an estimate of the transit...