Sciweavers

4229 search results - page 221 / 846
» On the Optimality of Spiral Search
Sort
View
EVOW
2009
Springer
15 years 6 months ago
Finding Balanced Incomplete Block Designs with Metaheuristics
This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulat...
David Rodríguez Rueda, Carlos Cotta, Antoni...
GECCO
2006
Springer
146views Optimization» more  GECCO 2006»
15 years 5 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
ACII
2005
Springer
15 years 3 months ago
Simulated Annealing Based Hand Tracking in a Discrete Space
Hand tracking is a challenging problem due to the complexity of searching in a 20+ degrees of freedom (DOF) space for an optimal estimation of hand configuration. This paper repres...
Wei Liang, Yunde Jia, Yang Liu, Cheng Ge
WOA
2007
15 years 2 months ago
A Swarm Intelligence Method Applied to Manufacturing Scheduling
—In this paper we present a multi-agent search technique to face the NP-hard single machine total weighted tardiness scheduling problem in presence of sequence-dependent setup ti...
Davide Anghinolfi, Antonio Boccalatte, Alberto Gro...
EC
2007
167views ECommerce» more  EC 2007»
15 years 1 months ago
Comparison-Based Algorithms Are Robust and Randomized Algorithms Are Anytime
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...
Sylvain Gelly, Sylvie Ruette, Olivier Teytaud