250 search results - page 14 / 50 » General variable neighborhood search for the continuous opti... |
101
click to vote
SOCO
2010
Springer
2010
Springer
Evaluating a local genetic algorithm as context-independent local search operator for metaheuristics
14 years 10 months ago
Local genetic algorithms have been designed with the aim of providing effective intensification. One of their most outstanding features is that they may help classical local searc...
EWCBR
2004
Springer
15 years 3 months ago
2004
Springer
The concept of generalized cases has been proven useful when searching for configurable and flexible products, for instance, reusable components in the area of electronic design au...
109
click to vote
FUZZY
2001
Springer
15 years 4 months ago
2001
Springer
Simulated annealing is a general optimisation algorithm, based on hill-climbing. As in hill-climbing, new candidate solutions are selected from the ‘neighbourhood’ of the curre...
GECCO
2008
Springer
15 years 25 days ago
2008
Springer
This work studies the mGA operator (Micro Genetic Algorithm), that has been proposed in literature as a “local search” operator for optimization with Genetic Algorithm. A new ...
ICCV
2009
IEEE
16 years 4 months ago
2009
IEEE
One of the key factors for the success of recent energy
minimization methods is that they seek to compute global
solutions. Even for non-convex energy functionals, optimization
...