Sciweavers

377 search results - page 4 / 76
» Convergence of Stochastic Iterative Dynamic Programming Algo...
Sort
View
ICML
1995
IEEE
14 years 8 months ago
Stable Function Approximation in Dynamic Programming
The success ofreinforcement learninginpractical problems depends on the ability to combine function approximation with temporal di erence methods such as value iteration. Experime...
Geoffrey J. Gordon
ICML
2000
IEEE
14 years 8 months ago
Convergence Problems of General-Sum Multiagent Reinforcement Learning
Stochastic games are a generalization of MDPs to multiple agents, and can be used as a framework for investigating multiagent learning. Hu and Wellman (1998) recently proposed a m...
Michael H. Bowling
MP
2011
13 years 2 months ago
A first-order interior-point method for linearly constrained smooth optimization
Abstract: We propose a first-order interior-point method for linearly constrained smooth optimization that unifies and extends first-order affine-scaling method and replicator d...
Paul Tseng, Immanuel M. Bomze, Werner Schachinger
PAMI
2010
180views more  PAMI 2010»
13 years 2 months ago
Point Set Registration via Particle Filtering and Stochastic Dynamics
In this paper, we propose a particle filtering approach for the problem of registering two point sets that differ by a rigid body transformation. Typically, registration algorithms...
Romeil Sandhu, Samuel Dambreville, Allen Tannenbau...
CORR
2008
Springer
116views Education» more  CORR 2008»
13 years 7 months ago
Polynomial Filtering for Fast Convergence in Distributed Consensus
Abstract--In the past few years, the problem of distributed consensus has received a lot of attention, particularly in the framework of ad hoc sensor networks. Most methods propose...
Effrosini Kokiopoulou, Pascal Frossard