Sciweavers

242 search results - page 3 / 49
» Exploration of a Two Sided Rendezvous Search Problem Using G...
Sort
View
GECCO
2006
Springer
188views Optimization» more  GECCO 2006»
13 years 11 months ago
Dominance learning in diploid genetic algorithms for dynamic optimization problems
This paper proposes an adaptive dominance mechanism for diploidy genetic algorithms in dynamic environments. In this scheme, the genotype to phenotype mapping in each gene locus i...
Shengxiang Yang
CEC
2008
IEEE
14 years 1 months ago
A contour method in population-based stochastic algorithms
—Inspired by the contours in topography, this paper proposes a contour method for the population-based stochastic algorithms to solve the problems with continuous variables. Rely...
Ying Lin, Jun Zhang, Lu-kai Lan
CEC
2010
IEEE
13 years 8 months ago
Fitness landscape analysis for evolutionary non-photorealistic rendering
The best evolutionary approach can be a difficult problem. In this work we have investigated two evolutionary representations to evolve non-photorealistic renderings: a variable-le...
Jeff Riley, Victor Ciesielski
FGCS
2007
106views more  FGCS 2007»
13 years 7 months ago
A parallel hybrid genetic algorithm for protein structure prediction on the computational grid
Solving the structure prediction problem for complex proteins is difficult and computationally expensive. In this paper, we propose a bicriterion parallel hybrid genetic algorith...
Alexandru-Adrian Tantar, Nouredine Melab, El-Ghaza...
CEC
2008
IEEE
14 years 1 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