Sciweavers

229 search results - page 11 / 46
» Structure and Performance of Fine-Grain Parallelism in Genet...
Sort
View
GECCO
2007
Springer
154views Optimization» more  GECCO 2007»
14 years 2 months ago
Finding critical backbone structures with genetic algorithms
This paper introduces the concept of a critical backbone as a minimal set of variables or part of the solution necessary to be within the basin of attraction of the global optimum...
Adam Prügel-Bennett
ESCIENCE
2007
IEEE
13 years 11 months ago
Grid-Enabling an Efficient Algorithm for Demanding Global Optimization Problems in Genetic Analysis
Abstract. We study the implementation on grid systems of an efficient algorithm for demanding global optimization problems. Specifically, we consider problems arising in the geneti...
Mahen Jayawardena, Sverker Holmgren
AAAI
2000
13 years 9 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...
GECCO
2008
Springer
139views Optimization» more  GECCO 2008»
13 years 9 months ago
Voronoi-initializated island models for solving real-coded deceptive problems
Deceptive problems have always been considered difficult for Genetic Algorithms. To cope with this characteristic, the literature has proposed the use of Parallel Genetic Algorith...
Santiago Muelas, José Manuel Peña, V...
HPCC
2005
Springer
14 years 1 months ago
A Loop-Aware Search Strategy for Automated Performance Analysis
Abstract. Automated online search is a powerful technique for performance diagnosis. Such a search can change the types of experiments it performs while the program is running, mak...
Eli D. Collins, Barton P. Miller