270 search results - page 6 / 54 » Optimizing Global-Local Search Hybrids |
ICTAI
1999
IEEE
13 years 11 months ago
1999
IEEE
Recently, there has been much interest in enhancing purely combinatorial formalisms with numerical information. For example, planning formalisms can be enriched by taking resource...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Abstract--Low-complexity near-optimal detection of large-MIMO signals has attracted recent research. Recently, we proposed a local neighborhood search algorithm, namely reactive ta...
HAIS
2009
Springer
14 years 2 days ago
2009
Springer
The hybridization of heuristics methods aims at exploring the synergies among stand alone heuristics in order to achieve better results for the optimization problem under study. In...
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
In recent decades, many meta-heuristics, including genetic algorithm (GA), ant colony optimization (ACO) and various local search (LS) procedures have been developed for solving a...
PPSN
2004
Springer
14 years 24 days ago
2004
Springer
We consider the problem of finding small Golomb rulers, a hard combinatorial optimization task. This problem is here tackled by means of a hybrid evolutionary algorithm (EA). This...