771 search results - page 142 / 155 » Markov Decision Processes with Arbitrary Reward Processes |
107
click to vote
ICTAI
2009
IEEE
14 years 9 months ago
2009
IEEE
We introduce TiMDPpoly, an algorithm designed to solve planning problems with durative actions, under probabilistic uncertainty, in a non-stationary, continuous-time context. Miss...
97
Voted
TSMC
2011
14 years 6 months ago
2011
—This paper introduces an algorithm for direct search of control policies in continuous-state discrete-action Markov decision processes. The algorithm looks for the best closed-l...
109
Voted
CORR
2011
Springer
14 years 6 months ago
2011
Springer
Privacy policies often place requirements on the purposes for which a governed entity may use personal information. For example, regulations, such as HIPAA, require that hospital ...
101
click to vote
AAAI
2012
13 years 2 months ago
2012
We consider symbolic dynamic programming (SDP) for solving Markov Decision Processes (MDP) with factored state and action spaces, where both states and actions are described by se...
DAC
2005
ACM
16 years 19 days ago
2005
ACM
As Si CMOS devices are scaled down into the nanoscale regime, current computer architecture approaches are reaching their practical limits. Future nano-architectures will confront...