6042 search results - page 810 / 1209 » Repeated Observation Models |
156
click to vote
UAI
2001
15 years 8 months ago
2001
There exist a number of reinforcement learning algorithms which learn by climbing the gradient of expected reward. Their long-run convergence has been proved, even in partially ob...
188
click to vote
UAI
2003
15 years 8 months ago
2003
Learning with hidden variables is a central challenge in probabilistic graphical models that has important implications for many real-life problems. The classical approach is usin...
170
click to vote
USENIX
2003
15 years 8 months ago
2003
We propose a new approach for I/O scheduling that performs on-line simulation of the underlying disk. When simulation is integrated within a system, three key challenges must be a...
186
click to vote
AAAI
1996
15 years 8 months ago
1996
We present a method for specifying temporal constraints on trajectories of dynamical systems and enforcing them during qualitative simulation. This capability can be used to focus...
176
click to vote
ACL
1994
15 years 8 months ago
1994
An automatic compound retrieval method is proposed to extract compounds within a text message. It uses n-gram mutual information, relative frequency count and parts of speech as t...