Sciweavers

Share
107 search results - page 1 / 22
» Solving deceptive problems using a genetic algorithm with re...
Sort
View
CEC
2008
IEEE
8 years 10 months ago
Solving deceptive problems using a genetic algorithm with reserve selection
— Deceptive problems are a class of challenging problems for conventional genetic algorithms (GAs), which usually mislead the search to some local optima rather than the global o...
Yang Chen, Jinglu Hu, Kotaro Hirasawa, Songnian Yu
GECCO
2008
Springer
139views Optimization» more  GECCO 2008»
8 years 4 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...
GECCO
2004
Springer
124views Optimization» more  GECCO 2004»
8 years 8 months ago
A Statistical Model of GA Dynamics for the OneMax Problem
A model of the dynamics of solving the counting-ones (OneMax) problem using a simple genetic algorithm (GA) is developed. It uses statistics of the early generations of GA runs to ...
Bulent Buyukbozkirli, Erik D. Goodman
ICNSC
2008
IEEE
8 years 10 months ago
Multiple Sequence Alignment Based on Genetic Algorithms with Reserve Selection
— This paper presents an approach to the multiple sequence alignment (MSA) problem by applying genetic algorithms with a reserve selection mechanism. MSA is one of the most funda...
Yang Chen, Jinglu Hu, Kotaro Hirasawa, Songnian Yu
CEC
2007
IEEE
8 years 9 months ago
Performance tuning of genetic algorithms with reserve selection
Abstract— This paper provides a deep insight into the performance of genetic algorithms with reserve selection (GARS), and investigates how parameters can be regulated to solve o...
Yang Chen, Jinglu Hu, Kotaro Hirasawa, Songnian Yu
books