1340 search results - page 14 / 268 » Kalman Temporal Differences |
ML
2000
ACM
13 years 7 months ago
2000
ACM
In this paper we present TDLEAF( ), a variation on the TD( ) algorithm that enables it to be used in conjunction with game-tree search. We present some experiments in which our che...
ML
2002
ACM
13 years 7 months ago
2002
ACM
TD() is a popular family of algorithms for approximate policy evaluation in large MDPs. TD() works by incrementally updating the value function after each observed transition. It h...
NECO
2010
13 years 5 months ago
2010
ICIP
2010
IEEE
13 years 5 months ago
2010
IEEE
In this paper we describe a new algorithm focused on obtaining stationary foreground regions, which is useful for applications like the detection of abandoned/stolen objects and p...