Sciweavers

1458 search results - page 196 / 292
» Monads for incremental computing
Sort
View
162
Voted
UAI
2008
15 years 5 months ago
Dyna-Style Planning with Linear Function Approximation and Prioritized Sweeping
We consider the problem of efficiently learning optimal control policies and value functions over large state spaces in an online setting in which estimates must be available afte...
Richard S. Sutton, Csaba Szepesvári, Alborz...
AI
2008
Springer
15 years 3 months ago
An approach to efficient planning with numerical fluents and multi-criteria plan quality
Dealing with numerical information is practically important in many real-world planning domains where the executability of an action can depend on certain numerical conditions, an...
Alfonso Gerevini, Alessandro Saetti, Ivan Serina
CIKM
2011
Springer
14 years 3 months ago
MTopS: scalable processing of continuous top-k multi-query workloads
A continuous top-k query retrieves the k most preferred objects in a data stream according to a given preference function. These queries are important for a broad spectrum of appl...
Avani Shastri, Di Yang, Elke A. Rundensteiner, Mat...
ICCV
2009
IEEE
16 years 8 months ago
Bayesian selection of scaling laws for motion modeling in images
Based on scaling laws describing the statistical structure of turbulent motion across scales, we propose a multiscale and non-parametric regularizer for optic-flow estimation. R...
Patrick H´eas, Etienne M´emin, Dominique Heitz, ...
CVPR
2003
IEEE
16 years 5 months ago
An Efficient Approach to Learning Inhomogeneous Gibbs Model
Inhomogeneous Gibbs model (IGM) [4] is an effective maximum entropy model in characterizing complex highdimensional distributions. However, its training process is so slow that th...
Ziqiang Liu, Hong Chen, Heung-Yeung Shum