34 search results - page 5 / 7 » Reachability in Recursive Markov Decision Processes |
122
click to vote
FLAIRS
2008
15 years 6 months ago
2008
We are interested in building decision-support software for social welfare case managers. Our model in the form of a factored Markov decision process is so complex that a standard...
135
click to vote
ENTCS
2002
15 years 3 months ago
2002
We report on the automatic verification of timed probabilistic properties of the IEEE 1394 root contention protocol combining two existing tools: the real-time modelchecker Kronos...
158
click to vote
QEST
2006
IEEE
15 years 10 months ago
2006
IEEE
Abstract— This paper reports on our efforts to link an industrial state-of-the-art modelling tool to academic state-of-the-art analysis algorithms. In a nutshell, we enable timed...
133
click to vote
AAAI
2006
15 years 5 months ago
2006
We present a new algorithm, called incremental least squares policy iteration (ILSPI), for finding the infinite-horizon stationary policy for partially observable Markov decision ...
137
click to vote
ATAL
2007
Springer
15 years 8 months ago
2007
Springer
This paper extends the framework of dynamic influence diagrams (DIDs) to the multi-agent setting. DIDs are computational representations of the Partially Observable Markov Decisio...