Sciweavers

9841 search results - page 511 / 1969
» Distributed Value Functions
Sort
View
AIPS
2010
15 years 9 months ago
Classical Planning in MDP Heuristics: with a Little Help from Generalization
Heuristic functions make MDP solvers practical by reducing their time and memory requirements. Some of the most effective heuristics (e.g., the FF heuristic function) first determ...
Andrey Kolobov, Mausam, Daniel S. Weld
ICML
2000
IEEE
16 years 7 months ago
Rates of Convergence for Variable Resolution Schemes in Optimal Control
This paper presents a general method to derive tight rates of convergence for numerical approximations in optimal control when we consider variable resolution grids. We study the ...
Andrew W. Moore, Rémi Munos
STOC
2007
ACM
140views Algorithms» more  STOC 2007»
16 years 7 months ago
On the submodularity of influence in social networks
We prove and extend a conjecture of Kempe, Kleinberg, and Tardos (KKT) on the spread of influence in social networks. A social network can be represented by a directed graph where...
Elchanan Mossel, Sébastien Roch
EUROPAR
2007
Springer
16 years 1 months ago
Locality Optimized Shared-Memory Implementations of Iterated Runge-Kutta Methods
Iterated Runge-Kutta (IRK) methods are a class of explicit solution methods for initial value problems of ordinary differential equations (ODEs) which possess a considerable poten...
Matthias Korch, Thomas Rauber
ICMCS
2006
IEEE
122views Multimedia» more  ICMCS 2006»
16 years 1 months ago
An Improved Approach to the Line-Based Face Recognition
The line-based face recognition method is distinguished by its features, but its development and application is limited to some inherent drawbacks. This paper propose a method for...
Anlong Ming, Huadong Ma