Sciweavers

2354 search results - page 274 / 471
» Randomness, Stochasticity and Approximations
Sort
View
IJCAI
2003
15 years 7 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
15 years 7 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
NIPS
1990
15 years 7 months ago
Convergence of a Neural Network Classifier
In this paper, we show that the LVQ learning algorithm converges to locally asymptotic stable equilibria of an ordinary differential equation. We show that the learning algorithm ...
John S. Baras, Anthony LaVigna
GECCO
2008
Springer
139views Optimization» more  GECCO 2008»
15 years 7 months ago
Coordinate change operators for genetic algorithms
This paper studies the issue of space coordinate change in genetic algorithms, based on two methods: convex quadratic approximations, and principal component analysis. In both met...
Elizabeth F. Wanner, Eduardo G. Carrano, Ricardo H...
ICASSP
2010
IEEE
15 years 6 months ago
An efficient particle filtering technique on the Grassmann manifold
Subspace tracking methods are widespread in signal and image processing. To reduce the influence of perturbations or outliers on the measurements, some authors have used a stocha...
Quentin Rentmeesters, Pierre-Antoine Absil, Paul V...