129 search results - page 15 / 26 » Abstractive Meeting Summarization as a Markov Decision Proce... |
160
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
To use their pool of resources efficiently, distributed stream-processing systems push query operators to nodes within the network. Currently, these operators, ranging from simple...
ICML
2004
IEEE
15 years 10 months ago
2004
IEEE
Motivated by the interest in relational reinforcement learning, we introduce a novel relational Bellman update operator called ReBel. It employs a constraint logic programming lan...
ML
2002
ACM
14 years 9 months ago
2002
ACM
Abstract. The problemof state abstractionis of centralimportancein optimalcontrol,reinforcement learning and Markov decision processes. This paper studies the case of variable reso...
144
click to vote
ILP
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. Many reinforcement learning domains are highly relational. While traditional temporal-difference methods can be applied to these domains, they are limited in their capaci...
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract— Research on numerical solution methods for partially observable Markov decision processes (POMDPs) has primarily focused on discrete-state models, and these algorithms ...