Sciweavers

473 search results - page 24 / 95
» Rank based variation operators for genetic algorithms
Sort
View
89
Voted
GECCO
2006
Springer
166views Optimization» more  GECCO 2006»
15 years 4 months ago
Comparing genetic robustness in generational vs. steady state evolutionary algorithms
Previous research has shown that evolutionary systems not only try to develop solutions that satisfy a fitness requirement, but indirectly attempt to develop genetically robust so...
Josh Jones, Terry Soule
93
Voted
GPEM
2000
121views more  GPEM 2000»
15 years 12 days ago
Bayesian Methods for Efficient Genetic Programming
ct. A Bayesian framework for genetic programming GP is presented. This is motivated by the observation that genetic programming iteratively searches populations of fitter programs ...
Byoung-Tak Zhang
265
Voted
JMIV
2007
484views more  JMIV 2007»
15 years 14 days ago
On Semismooth Newton's Methods for Total Variation Minimization
In [2], Chambolle proposed an algorithm for minimizing the total variation of an image. In this short note, based on the theory on semismooth operators, we study semismooth Newton...
Michael K. Ng, Liqun Qi, Yu-Fei Yang, Yu-Mei Huang
HIS
2003
15 years 2 months ago
PDGA: the Primal-Dual Genetic Algorithm
Abstract. Genetic algorithms (GAs) are a class of search algorithms based on principles of natural evolution. Hence, incorporating mechanisms used in nature may improve the perform...
Shengxiang Yang
86
Voted
GECCO
2004
Springer
15 years 6 months ago
Selection-Insertion Schemes in Genetic Algorithms for the Flexible Ligand Docking Problem
Abstract. In this work we have implemented and analyzed the performance of a new real coded steady-state genetic algorithm (SSGA) for the flexible ligand-receptor docking problem....
Camila S. de Magalhães, Helio J. C. Barbosa...