Sciweavers

451 search results - page 32 / 91
» Approximation algorithms for stochastic orienteering
Sort
View
PR
2007
100views more  PR 2007»
13 years 8 months ago
Linear manifold clustering in high dimensional spaces by stochastic search
Classical clustering algorithms are based on the concept that a cluster center is a single point. Clusters which are not compact around a single point are not candidates for class...
Robert M. Haralick, Rave Harpaz
GECCO
2007
Springer
182views Optimization» more  GECCO 2007»
14 years 18 days ago
Stochastic training of a biologically plausible spino-neuromuscular system model
A primary goal of evolutionary robotics is to create systems that are as robust and adaptive as the human body. Moving toward this goal often involves training control systems tha...
Stanley Phillips Gotshall, Terence Soule
GECCO
2008
Springer
179views Optimization» more  GECCO 2008»
13 years 9 months ago
ASAGA: an adaptive surrogate-assisted genetic algorithm
Genetic algorithms (GAs) used in complex optimization domains usually need to perform a large number of fitness function evaluations in order to get near-optimal solutions. In rea...
Liang Shi, Khaled Rasheed
UAI
2001
13 years 10 months ago
Toward General Analysis of Recursive Probability Models
There is increasing interest within the research community in the design and use of recursive probability models. There remains concern about computational complexity costs and th...
Daniel Pless, George F. Luger
CDC
2010
IEEE
167views Control Systems» more  CDC 2010»
13 years 3 months ago
Numerical methods for the optimization of nonlinear stochastic delay systems, and an application to internet regulation
The Markov chain approximation method is an effective and widely used approach for computing optimal values and controls for stochastic systems. It was extended to nonlinear (and p...
Harold J. Kushner