Sciweavers

451 search results - page 41 / 91
» Approximation algorithms for stochastic orienteering
Sort
View
IJCAI
2003
13 years 10 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
UAI
1998
13 years 10 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»
13 years 8 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
NIPS
2004
13 years 10 months ago
Joint Tracking of Pose, Expression, and Texture using Conditionally Gaussian Filters
We present a generative model and stochastic filtering algorithm for simultaneous tracking of 3D position and orientation, non-rigid motion, object texture, and background texture...
Tim K. Marks, John R. Hershey, J. Cooper Roddey, J...
COMPGEOM
2009
ACM
14 years 3 months ago
Randomly removing g handles at once
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
Glencora Borradaile, James R. Lee, Anastasios Sidi...