Sciweavers

31 search results - page 4 / 7
» A Method for Solving Special Circulant Pentadiagonal Linear ...
Sort
View
CDC
2010
IEEE
139views Control Systems» more  CDC 2010»
14 years 4 months ago
Q-learning and enhanced policy iteration in discounted dynamic programming
We consider the classical finite-state discounted Markovian decision problem, and we introduce a new policy iteration-like algorithm for finding the optimal state costs or Q-facto...
Dimitri P. Bertsekas, Huizhen Yu
SIAMSC
2008
127views more  SIAMSC 2008»
14 years 9 months ago
On Diagonally Relaxed Orthogonal Projection Methods
Abstract. We propose and study a block-iterative projections method for solving linear equations and/or inequalities. The method allows diagonal component-wise relaxation in conjun...
Yair Censor, Tommy Elfving, Gabor T. Herman, Toura...
SIAMJO
2008
79views more  SIAMJO 2008»
14 years 9 months ago
A Class of Inexact Variable Metric Proximal Point Algorithms
For the problem of solving maximal monotone inclusions, we present a rather general class of algorithms, which contains hybrid inexact proximal point methods as a special case and ...
Lisandro A. Parente, Pablo A. Lotito, Mikhail V. S...
ISCA
2002
IEEE
174views Hardware» more  ISCA 2002»
14 years 9 months ago
Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
Sibabrata Ray, Hong Jiang
ECCV
2006
Springer
15 years 11 months ago
Direct Solutions for Computing Cylinders from Minimal Sets of 3D Points
Efficient direct solutions for the determination of a cylinder from points are presented. The solutions range from the well known direct solution of a quadric to the minimal soluti...
Christian Beder, Wolfgang Förstner