Sciweavers

439 search results - page 8 / 88
» Neighborhood Structures for GPU-Based Local Search Algorithm...
Sort
View
CEC
2010
IEEE
13 years 8 months ago
Sequential DE enhanced by neighborhood search for Large Scale Global Optimization
— In this paper, the performance of a sequential Differential Evolution (DE) enhanced by neighborhood search (SDENS) is reported on the set of benchmark functions provided for th...
Hui Wang, Zhijian Wu, Shahryar Rahnamayan, Dazhi J...
ICNC
2005
Springer
14 years 2 months ago
Local Search for the Maximum Parsimony Problem
Abstract. Four local search algorithms are investigated for the phylogenetic tree reconstruction problem under the Maximum Parsimony criterion. A new subtree swapping neighborhood ...
Adrien Goëffon, Jean-Michel Richer, Jin-Kao H...
GECCO
2008
Springer
104views Optimization» more  GECCO 2008»
13 years 9 months ago
Understanding elementary landscapes
The landscape formalism unites a finite candidate solution set to a neighborhood topology and an objective function. This construct can be used to model the behavior of local sea...
Darrell Whitley, Andrew M. Sutton, Adele E. Howe
AAAI
2010
13 years 10 months ago
Fast Local Search Algorithm for Weighted Feedback Arc Set in Tournaments
We present a fast local search algorithm that finds an improved solution (if there is any) in the k-exchange neighborhood of the given solution to an instance of WEIGHTED FEEDBACK...
Fedor V. Fomin, Daniel Lokshtanov, Venkatesh Raman...
CEC
2007
IEEE
13 years 8 months ago
Designing memetic algorithms for real-world applications using self-imposed constraints
— Memetic algorithms (MAs) combine the global exploration abilities of evolutionary algorithms with a local search to further improve the solutions. While a neighborhood can be e...
Thomas Michelitsch, Tobias Wagner, Dirk Biermann, ...