Sciweavers

3514 search results - page 64 / 703
» A search space
Sort
View
GECCO
2009
Springer
161views Optimization» more  GECCO 2009»
14 years 1 months ago
Benchmarking the BFGS algorithm on the BBOB-2009 noisy testbed
The BFGS quasi-Newton method is benchmarked on the noisy BBOB-2009 testbed. A multistart strategy is applied with a maximum number of function evaluations of about 104 times the s...
Raymond Ros
GECCO
2009
Springer
148views Optimization» more  GECCO 2009»
14 years 1 months ago
Benchmarking the NEWUOA on the BBOB-2009 noisy testbed
The NEWUOA which belongs to the class of DerivativeFree optimization algorithms is benchmarked on the BBOB2009 noisy testbed. A multistart strategy is applied with a maximum numbe...
Raymond Ros
ICGA
2007
90views Optimization» more  ICGA 2007»
13 years 9 months ago
Game Over: Black to Play and Draw in Checkers
In 1989, an effort to solve the game of checkers began. It was naïve because of the daunting size of the search space, 5×1020 positions, and because of computer capabilities of ...
Jonathan Schaeffer
CIKM
2008
Springer
13 years 11 months ago
A metric cache for similarity search
Similarity search in metric spaces is a general paradigm that can be used in several application fields. It can also be effectively exploited in content-based image retrieval syst...
Fabrizio Falchi, Claudio Lucchese, Salvatore Orlan...
LION
2009
Springer
203views Optimization» more  LION 2009»
14 years 3 months ago
Position-Guided Tabu Search Algorithm for the Graph Coloring Problem
A very undesirable behavior of any heuristic algorithm is to be stuck in some specific parts of the search space, in particular in the basins of attraction of the local optima. Wh...
Daniel Cosmin Porumbel, Jin-Kao Hao, Pascale Kuntz