515 search results - page 65 / 103 » Approximating Markov Processes by Averaging |
206
click to vote
ICML
1996
IEEE
15 years 10 months ago
1996
IEEE
This paper presents a direct reinforcement learning algorithm, called Finite-Element Reinforcement Learning, in the continuous case, i.e. continuous state-space and time. The eval...
173
click to vote
CICLING
2006
Springer
15 years 10 months ago
2006
Springer
Annotated corpora are valuable resources for NLP which are often costly to create. We introduce a method for transferring annotation from a morphologically annotated corpus of a so...
129
click to vote
TIT
2002
15 years 6 months ago
2002
This paper focuses on jammed timing channels. Pure delay jammers with a maximum delay constraint, an average delay constraint, or a maximum buffer size constraint are explored, for...
148
click to vote
GECCO
2005
Springer
16 years 6 days ago
2005
Springer
Recent adaptive image interpretation systems can reach optimal performance for a given domain via machine learning, without human intervention. The policies are learned over an ex...
176
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
Decentralized partially observable Markov decision processes (Dec-POMDPs) constitute a generic and expressive framework for multiagent planning under uncertainty. However, plannin...