2393 search results - page 101 / 479 » Bounds-Consistent Local Search |
DAWAK
2005
Springer
15 years 6 months ago
2005
Springer
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rando...
102
Voted
ISCI
2008
15 years 20 days ago
2008
A biclustering algorithm, based on a greedy technique and enriched with a local search strategy to escape poor local minima, is proposed. The algorithm starts with an initial rand...
91
Voted
CG
2010
Springer
14 years 10 months ago
2010
Springer
We define the Rook Jumping Maze, provide historical perspective, and describe a generation method for such mazes. When applying stochastic local search algorithms to maze design, m...
136
click to vote
NMA
2010
14 years 10 months ago
2010
One of the most important applications of the Asymmetric Hamiltonian Path Problem is in scheduling. In this paper we describe a variant of this problem, and develop both a mathemat...
104
Voted
GECCO
2008
Springer
15 years 1 months ago
2008
Springer
In this paper we propose a novel iterative search procedure for multi-objective optimization problems. The iteration process – though derivative free – utilizes the geometry o...