Sciweavers

444 search results - page 27 / 89
» Solving Mastermind Using Genetic Algorithms
Sort
View
KES
1999
Springer
14 years 26 days ago
Parallel genetic algorithm taxonomy
—Genetic Algorithms (GAs) are powerful search techniques that are used to solve difficult problems in many disciplines. Unfortunately, they can be very demanding in terms of com...
Mariusz Nowostawski, Riccardo Poli
CEC
2008
IEEE
14 years 3 months ago
Correlation clustering based on genetic algorithm for documents clustering
—Correlation clustering problem is a NP hard problem and technologies for the solving of correlation clustering problem can be used to cluster given data set with relation matrix...
Zhenya Zhang, Hongmei Cheng, Wanli Chen, Shuguang ...
GECCO
2010
Springer
207views Optimization» more  GECCO 2010»
14 years 1 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
GECCO
2008
Springer
159views Optimization» more  GECCO 2008»
13 years 9 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
2004
Springer
132views Optimization» more  GECCO 2004»
14 years 2 months ago
Robust and Efficient Genetic Algorithms with Hierarchical Niching and a Sustainable Evolutionary Computation Model
This paper proposes a new niching method named hierarchical niching, which combines spatial niching in search space and a continuous temporal niching concept. The method is natural...
Jianjun Hu, Erik D. Goodman