Sciweavers

3120 search results - page 158 / 624
» A parameter-less genetic algorithm
Sort
View
192
Voted
GECCO
2007
Springer
437views Optimization» more  GECCO 2007»
15 years 9 months ago
A gestalt genetic algorithm: less details for better search
The basic idea to defend in this paper is that an adequate perception of the search space, sacrificing most of the precision, can paradoxically accelerate the discovery of the mo...
Christophe Philemotte, Hugues Bersini
166
Voted
GECCO
2010
Springer
207views Optimization» more  GECCO 2010»
15 years 8 months ago
Generalized crowding for genetic algorithms
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
Severino F. Galán, Ole J. Mengshoel
144
Voted
LCTRTS
1999
Springer
15 years 8 months ago
Optimizing for Reduced Code Space using Genetic Algorithms
Code space is a critical issue facing designers of software for embedded systems. Many traditional compiler optimizations are designed to reduce the execution time of compiled cod...
Keith D. Cooper, Philip J. Schielke, Devika Subram...
141
Voted
GECCO
2006
Springer
154views Optimization» more  GECCO 2006»
15 years 7 months ago
Emergent mating topologies in spatially structured genetic algorithms
The application of network analysis to emergent mating topologies in spatially structured genetic algorithms is presented in this preliminary study as a framework for inferring ev...
Joshua L. Payne, Margaret J. Eppstein
152
Voted
PDPTA
2000
15 years 5 months ago
Evaluation of Neural and Genetic Algorithms for Synthesizing Parallel Storage Schemes
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...
Mayez A. Al-Mouhamed, Husam Abu-Haimed