Sciweavers

472 search results - page 19 / 95
» Design of Iterated Local Search Algorithms
Sort
View
IJKESDP
2010
149views more  IJKESDP 2010»
14 years 8 months ago
An approximate solution method based on tabu search for k-minimum spanning tree problems
—This paper considers k-minimum spanning tree problems. An existing solution algorithm based on tabu search, which was proposed by Katagiri et al., includes an iterative solving ...
Hideki Katagiri, Tomohiro Hayashida, Ichiro Nishiz...
88
Voted
ESANN
2006
14 years 11 months ago
Diversity creation in local search for the evolution of neural network ensembles
Abstract. The EENCL algorithm [1] automatically designs neural network ensembles for classification, combining global evolution with local search based on gradient descent. Two mec...
Pete Duell, Iris Fermin, Xin Yao
JSAC
2008
56views more  JSAC 2008»
14 years 9 months ago
An efficient hierarchical optical path network design algorithm based on a traffic demand expression in a cartesian product spac
We propose a hierarchical optical path network design algorithm. In order to efficiently accommodate wavelength paths in each waveband path, we define a source-destination Cartesia...
Isao Yagyu, Hiroshi Hasegawa, Ken-ichi Sato
CP
2008
Springer
14 years 11 months ago
Switching among Non-Weighting, Clause Weighting, and Variable Weighting in Local Search for SAT
One way to design a local search algorithm that is effective on many types of instances is allowing this algorithm to switch among heuristics. In this paper, we refer to the way in...
Wanxia Wei, Chu Min Li, Harry Zhang
EMO
2009
Springer
143views Optimization» more  EMO 2009»
14 years 7 months ago
Adapting to the Habitat: On the Integration of Local Search into the Predator-Prey Model
Traditionally, Predator-Prey Models--although providing a more nature-oriented approach to multi-objective optimization than many other standard Evolutionary Multi-Objective Algori...
Christian Grimme, Joachim Lepping, Alexander Papas...