Sciweavers

5314 search results - page 400 / 1063
» Hybrid Dynamic Programming
Sort
View
NIPS
1994
15 years 8 months ago
Generalization in Reinforcement Learning: Safely Approximating the Value Function
To appear in: G. Tesauro, D. S. Touretzky and T. K. Leen, eds., Advances in Neural Information Processing Systems 7, MIT Press, Cambridge MA, 1995. A straightforward approach to t...
Justin A. Boyan, Andrew W. Moore
CORR
2007
Springer
94views Education» more  CORR 2007»
15 years 6 months ago
Paging and Registration in Cellular Networks: Jointly Optimal Policies and an Iterative Algorithm
— This paper explores optimization of paging and registration policies in cellular networks. Motion is modeled as a discrete-time Markov process, and minimization of the discount...
Bruce Hajek, Kevin Mitzel, Sichao Yang
CORR
2007
Springer
109views Education» more  CORR 2007»
15 years 6 months ago
Multiresolution Approximation of Polygonal Curves in Linear Complexity
: We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality b...
Pierre-Francois Marteau, Gildas Ménier
IJCV
2002
156views more  IJCV 2002»
15 years 6 months ago
Trinocular Stereo Using Shortest Paths and the Ordering Constraint
This paper describes a new algorithm for disparity estimation using trinocular stereo. The three cameras are placed in a right angled configuration. A graph is then constructed wh...
Motilal Agrawal
ISVC
2010
Springer
15 years 5 months ago
An Improved Shape Matching Algorithm for Deformable Objects Using a Global Image Feature
Abstract. We propose an improved shape matching algorithm that extends the work of Felzenszwalb [3]. In this approach, we use triangular meshes to represent deformable objects and ...
Jibum Kim, Suzanne M. Shontz