Sciweavers

213 search results - page 21 / 43
» A comparison of search heuristics for empirical code optimiz...
Sort
View
GECCO
2006
Springer
170views Optimization» more  GECCO 2006»
15 years 1 months ago
How an optimal observer can collapse the search space
Many metaheuristics have difficulty exploring their search space comprehensively. Exploration time and efficiency are highly dependent on the size and the ruggedness of the search...
Christophe Philemotte, Hugues Bersini
71
Voted
CEC
2005
IEEE
15 years 3 months ago
Sequential parameter optimization
Abstract- Sequential parameter optimization is a heuristic that combines classical and modern statistical techniques to improve the performance of search algorithms. To demonstrate...
Thomas Bartz-Beielstein, Christian Lasarczyk, Mike...
61
Voted
GECCO
2005
Springer
128views Optimization» more  GECCO 2005»
15 years 3 months ago
Fitness-based neighbor selection for multimodal function optimization
We propose a selection scheme called Fitness-based Neighbor Selection (FNS) for multimodal optimization. The FNS is aimed for ill-scaled and locally multimodal domain, both found ...
Shin Ando, Shigenobu Kobayashi
92
Voted
GECCO
2008
Springer
109views Optimization» more  GECCO 2008»
14 years 10 months ago
Focused no free lunch theorems
Proofs and empirical evidence are presented which show that a subset of algorithms can have identical performance over a subset of functions, even when the subset of functions is ...
Darrell Whitley, Jonathan E. Rowe
CORR
2007
Springer
121views Education» more  CORR 2007»
14 years 9 months ago
On the Minimum Number of Transmissions in Single-Hop Wireless Coding Networks
— The advent of network coding presents promising opportunities in many areas of communication and networking. It has been recently shown that network coding technique can signiï...
Salim Y. El Rouayheb, Mohammad Asad R. Chaudhry, A...