Sciweavers

580 search results - page 7 / 116
» Approximation Algorithms for Temporal Reasoning
Sort
View
ICCBR
2009
Springer
15 years 6 months ago
Spatial Event Prediction by Combining Value Function Approximation and Case-Based Reasoning
This paper presents a new approach for spatial event prediction that combines a value function approximation algorithm and case-based reasoning predictors. Each of these predictors...
Hua Li, Héctor Muñoz-Avila, Diane Br...
AAAI
2010
15 years 1 months ago
Soundness Preserving Approximation for TBox Reasoning
Large scale ontology applications require efficient and robust description logic (DL) reasoning services. Expressive DLs usually have very high worst case complexity while tractab...
Yuan Ren, Jeff Z. Pan, Yuting Zhao
ICML
2008
IEEE
16 years 13 days ago
A worst-case comparison between temporal difference and residual gradient with linear function approximation
Residual gradient (RG) was proposed as an alternative to TD(0) for policy evaluation when function approximation is used, but there exists little formal analysis comparing them ex...
Lihong Li
ICDE
2006
IEEE
156views Database» more  ICDE 2006»
16 years 1 months ago
Reasoning About Approximate Match Query Results
Join techniques deploying approximate match predicates are fundamental data cleaning operations. A variety of predicates have been utilized to quantify approximate match in such o...
Sudipto Guha, Nick Koudas, Divesh Srivastava, Xiao...
ML
2002
ACM
154views Machine Learning» more  ML 2002»
14 years 11 months ago
Technical Update: Least-Squares Temporal Difference Learning
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...
Justin A. Boyan