373 search results - page 5 / 75 » Nearness and uniform convergence |
COLT
2008
Springer
13 years 9 months ago
2008
Springer
Consider the problem of estimating the -level set G = {x : f(x) } of an unknown d-dimensional density function f based on n independent observations X1, . . . , Xn from the densi...
GECCO
2003
Springer
14 years 29 days ago
2003
Springer
This paper presents a modification of the particle swarm optimization algorithm (PSO) intended to combat the problem of premature convergence observed in many applications of PSO. ...
HAPTICS
2005
IEEE
14 years 1 months ago
2005
IEEE
— We present an algorithm that determines the point on a convex parametric surface patch that is closest to a given (possibly moving) point. Any initial point belonging to the su...
ICML
2004
IEEE
14 years 8 months ago
2004
IEEE
Synchronous reinforcement learning (RL) algorithms with linear function approximation are representable as inhomogeneous matrix iterations of a special form (Schoknecht & Merk...
LSSC
2001
Springer
14 years 6 days ago
2001
Springer
Abstract. Quasi-Monte Carlo methods are based on the idea that random Monte Carlo techniques can often be improved by replacing the underlying source of random numbers with a more ...