Sciweavers

580 search results - page 6 / 116
» Approximation Algorithms for Temporal Reasoning
Sort
View
ICML
2001
IEEE
16 years 13 days ago
Off-Policy Temporal Difference Learning with Function Approximation
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...
Doina Precup, Richard S. Sutton, Sanjoy Dasgupta
111
Voted
CSL
2001
Springer
15 years 4 months ago
A Logic for Approximate First-Order Reasoning
Abstract. In classical approaches to knowledge representation, reasoners are assumed to derive all the logical consequences of their knowledge base. As a result, reasoning in the ļ...
Frédéric Koriche
PKDD
2009
Springer
169views Data Mining» more  PKDD 2009»
15 years 6 months ago
Hybrid Least-Squares Algorithms for Approximate Policy Evaluation
The goal of approximate policy evaluation is to ā€œbestā€ represent a target value function according to a specific criterion. Temporal difference methods and Bellman residual m...
Jeffrey Johns, Marek Petrik, Sridhar Mahadevan
88
Voted
ICASSP
2010
IEEE
14 years 11 months ago
Multiple Selection Approximation for improved spatio-temporal prediction in video coding
In this contribution, a novel spatio-temporal prediction algorithm for video coding is introduced. This algorithm exploits temporal as well as spatial redundancies for effectively...
Jürgen Seiler, André Kaup
IJCAI
2007
15 years 1 months ago
Towards Reasoning about the Past in Neural-symbolic Systems
Reasoning about the past is of fundamental importance in several applications in computer science and artificial intelligence, including reactive systems and planning. In this pa...
Rafael V. Borges, Luís C. Lamb, Artur S. d'...