Sciweavers

7930 search results - page 625 / 1586
» Greedy in Approximation Algorithms
Sort
View
IJCAI
2003
15 years 8 months ago
Point-based value iteration: An anytime algorithm for POMDPs
This paper introduces the Point-Based Value Iteration (PBVI) algorithm for POMDP planning. PBVI approximates an exact value iteration solution by selecting a small set of represen...
Joelle Pineau, Geoffrey J. Gordon, Sebastian Thrun
NIPS
1998
15 years 8 months ago
Lazy Learning Meets the Recursive Least Squares Algorithm
Lazy learning is a memory-based technique that, once a query is received, extracts a prediction interpolating locally the neighboring examples of the query which are considered re...
Mauro Birattari, Gianluca Bontempi, Hugues Bersini
UAI
1998
15 years 8 months ago
Flexible Decomposition Algorithms for Weakly Coupled Markov Decision Problems
This paper presents two new approaches to decomposing and solving large Markov decision problems (MDPs), a partial decoupling method and a complete decoupling method. In these app...
Ronald Parr
ISCI
2008
96views more  ISCI 2008»
15 years 7 months ago
Fuzzy age-dependent replacement policy and SPSA algorithm based-on fuzzy simulation
An increase in the performance of deteriorating systems can be achieved through the adoption of suitable maintenance policies. One of the most popular maintenance policies is the ...
Jiashun Zhang, Ruiqing Zhao, Wansheng Tang
IJCV
2006
142views more  IJCV 2006»
15 years 7 months ago
Geometry and Convergence Analysis of Algorithms for Registration of 3D Shapes
The computation of a rigid body transformation which optimally aligns a set of measurement points with a surface and related registration problems are studied from the viewpoint o...
Helmut Pottmann, Qi-Xing Huang, Yong-Liang Yang, S...