Sciweavers

960 search results - page 156 / 192
» Optimal Monte Carlo Algorithms
Sort
View
GECCO
2007
Springer
155views Optimization» more  GECCO 2007»
14 years 1 months ago
Differential evolution and non-separability: using selective pressure to focus search
Recent results show that the Differential Evolution algorithm has significant difficulty on functions that are not linearly separable. On such functions, the algorithm must rely...
Andrew M. Sutton, Monte Lunacek, L. Darrell Whitle...
GECCO
2006
Springer
146views Optimization» more  GECCO 2006»
13 years 11 months ago
The dispersion metric and the CMA evolution strategy
An algorithm independent metric is introduced that measures the dispersion of a uniform random sample drawn from the top ranked percentiles of the search space. A low dispersion f...
Monte Lunacek, Darrell Whitley
SOCO
2010
Springer
13 years 6 months ago
Evaluating a local genetic algorithm as context-independent local search operator for metaheuristics
Local genetic algorithms have been designed with the aim of providing effective intensification. One of their most outstanding features is that they may help classical local searc...
Carlos García-Martínez, Manuel Lozan...
KDD
2004
ACM
624views Data Mining» more  KDD 2004»
14 years 1 months ago
Programming the K-means clustering algorithm in SQL
Using SQL has not been considered an efficient and feasible way to implement data mining algorithms. Although this is true for many data mining, machine learning and statistical a...
Carlos Ordonez
GECCO
2007
Springer
192views Optimization» more  GECCO 2007»
14 years 1 months ago
Convergence of stochastic search algorithms to gap-free pareto front approximations
Recently, a convergence proof of stochastic search algorithms toward finite size Pareto set approximations of continuous multi-objective optimization problems has been given. The...
Oliver Schütze, Marco Laumanns, Emilia Tantar...