Sciweavers

1914 search results - page 37 / 383
» Evaluation of a Catalytic Search Algorithm
Sort
View
ICGA
1993
75views Optimization» more  ICGA 1993»
13 years 9 months ago
Structure and Performance of Fine-Grain Parallelism in Genetic Search
Within the parallel genetic algorithm framework, there currently exists a growing dichotomy between coarse-pain and fine-grain parallel architectures. This paper attempts to chara...
Shumeet Baluja
KI
2007
Springer
14 years 2 months ago
A Stochastic Local Search Approach to Vertex Cover
We introduce a novel stochastic local search algorithm for the vertex cover problem. Compared to current exhaustive search techniques, our algorithm achieves excellent performance ...
Silvia Richter, Malte Helmert, Charles Gretton
ICTAI
2006
IEEE
14 years 2 months ago
Intelligent Neighborhood Exploration in Local Search Heuristics
Standard tabu search methods are based on the complete exploration of current solution neighborhood. However, for some problems with very large neighborhood or time-consuming eval...
Isabelle Devarenne, Hakim Mabed, Alexandre Caminad...
ECIR
2006
Springer
13 years 10 months ago
Clustering-Based Searching and Navigation in an Online News Source
The growing amount of online news posted on the WWW demands new algorithms that support topic detection, search, and navigation of news documents. This work presents an algorithm f...
Simón C. Smith, M. Andrea Rodríguez
GECCO
2009
Springer
147views Optimization» more  GECCO 2009»
14 years 1 months ago
Benchmarking the (1+1)-CMA-ES on the BBOB-2009 function testbed
The (1+1)-CMA-ES is an adaptive stochastic algorithm for the optimization of objective functions defined on a continuous search space in a black-box scenario. In this paper, an i...
Anne Auger, Nikolaus Hansen