656 search results - page 115 / 132 » Complexity of finite-horizon Markov decision process problem... |
123
click to vote
HRI
2007
ACM
15 years 5 months ago
2007
ACM
Intelligent planning algorithms such as the Partially Observable Markov Decision Process (POMDP) have succeeded in dialog management applications [10, 11, 12] because of their rob...
136
click to vote
IFM
2010
Springer
15 years 10 days ago
2010
Springer
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
129
Voted
ICML
2001
IEEE
16 years 2 months ago
2001
IEEE
We introduce the first algorithm for off-policy temporal-difference learning that is stable with linear function approximation. Off-policy learning is of interest because it forms...
132
click to vote
SIGMETRICS
2010
ACM
15 years 5 months ago
2010
ACM
We define CWS, a non-preemptive scheduling policy for workloads with correlated job sizes. CWS tackles the scheduling problem by inferring the expected sizes of upcoming jobs bas...
123
click to vote
TON
2002
15 years 1 months ago
2002
We consider a communication network with fixed routing that can accommodate multiple service classes, differing in bandwidth requirements, demand pattern, call duration, and routin...