Sciweavers

844 search results - page 19 / 169
» Generalized crowding for genetic algorithms
Sort
View
GECCO
2008
Springer
159views Optimization» more  GECCO 2008»
14 years 10 months ago
IGAP: interactive genetic algorithm peer to peer
We present IGAP, a peer to peer interactive genetic algorithm which reflects the real world methodology followed in team design. We apply our methodology to floorplanning. Throu...
Juan C. Quiroz, Amit Banerjee, Sushil J. Louis
GECCO
2007
Springer
293views Optimization» more  GECCO 2007»
15 years 3 months ago
Solving the artificial ant on the Santa Fe trail problem in 20, 696 fitness evaluations
In this paper, we provide an algorithm that systematically considers all small trees in the search space of genetic programming. These small trees are used to generate useful subr...
Steffen Christensen, Franz Oppacher
GECCO
2008
Springer
135views Optimization» more  GECCO 2008»
14 years 10 months ago
Evolving sequence patterns for prediction of sub-cellular locations of eukaryotic proteins
A genetic algorithm (GA) is utilised to discover known and novel PROSITE-like sequence templates that can be used to classify the sub-cellular location of eukaryotic proteins. Whi...
Greg Paperin
SAC
2010
ACM
14 years 4 months ago
Convex onion peeling genetic algorithm: an efficient solution to map labeling of point-feature
Map labeling of point-feature is the problem of placing text labels to corresponding point features on a map in a way that minimizes overlaps while satisfying basic rules for the ...
Wan D. Bae, Shayma Alkobaisi, Petr Vojtechovsk&yac...
GECCO
2006
Springer
206views Optimization» more  GECCO 2006»
15 years 1 months ago
Adaptive discretization for probabilistic model building genetic algorithms
This paper proposes an adaptive discretization method, called Split-on-Demand (SoD), to enable the probabilistic model building genetic algorithm (PMBGA) to solve optimization pro...
Chao-Hong Chen, Wei-Nan Liu, Ying-Ping Chen