682 search results - page 51 / 137 » One-Counter Markov Decision Processes |
134
click to vote
PERCOM
2007
ACM
16 years 3 months ago
2007
ACM
We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process ...
127
click to vote
ALT
2006
Springer
16 years 23 days ago
2006
Springer
We address the problem of reinforcement learning in which observations may exhibit an arbitrary form of stochastic dependence on past observations and actions. The task for an age...
135
click to vote
ATAL
2007
Springer
15 years 7 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...
129
click to vote
JAIR
2008
15 years 3 months ago
2008
Multi-agent planning in stochastic environments can be framed formally as a decentralized Markov decision problem. Many real-life distributed problems that arise in manufacturing,...
120
click to vote
MKWI
2008
15 years 5 months ago
2008
: In order to respond quickly to changing market requirements, a business organisation needs to increase the level of agility in all phases of the business process engineering chai...