656 search results - page 23 / 132 » Complexity of finite-horizon Markov decision process problem... |
131
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Recent attention in quickest change detection in the multi-sensor setting has been on the case where the densities of the observations change at the same instant at all the sensor...
134
click to vote
FOCS
2007
IEEE
15 years 8 months ago
2007
IEEE
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
141
Voted
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
Voted
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...
107
click to vote
ALT
2006
Springer
15 years 10 months 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...