Sciweavers

5 search results - page 1 / 1
» How to Escape Traps Using Clonal Selection Algorithms
Sort
View
ICINCO
2004
93views Robotics» more  ICINCO 2004»
13 years 6 months ago
How to Escape Traps Using Clonal Selection Algorithms
Vincenzo Cutello, Giuseppe Narzisi, Giuseppe Nicos...
ICARIS
2010
Springer
13 years 2 months ago
An Information-Theoretic Approach for Clonal Selection Algorithms
In this research work a large set of the classical numerical functions were taken into account in order to understand both the search capability and the ability to escape from a lo...
Vincenzo Cutello, Giuseppe Nicosia, Mario Pavone, ...
AAAI
2000
13 years 6 months ago
Dynamic Representations and Escaping Local Optima: Improving Genetic Algorithms and Local Search
Local search algorithms often get trapped in local optima. Algorithms such as tabu search and simulated annealing 'escape' local optima by accepting nonimproving moves. ...
Laura Barbulescu, Jean-Paul Watson, L. Darrell Whi...
IJCGA
2010
86views more  IJCGA 2010»
13 years 3 months ago
Leaving an Unknown Maze Using an Error-Prone Compass
Imagine you are trapped in a maze of caves. All you have is an old rusty compass and barely enough light to read it. How much inaccuracy can you allow to ensure that you can leave...
Tom Kamphans, Elmar Langetepe
CP
2006
Springer
13 years 8 months ago
Dynamic Symmetry Breaking Restarted
ion of a given partial assignment of values to variables. Compared with other symmetry breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodat...
Daniel S. Heller, Meinolf Sellmann