Sciweavers

150 search results - page 3 / 30
» Numeric Mutation: Improved Search in Genetic Programming
Sort
View
ICES
2010
Springer
148views Hardware» more  ICES 2010»
13 years 4 months ago
An Efficient Selection Strategy for Digital Circuit Evolution
In this paper, we propose a new modification of Cartesian Genetic Programming (CGP) that enables to optimize digital circuits more significantly than standard CGP. We argue that co...
Zbysek Gajda, Lukás Sekanina
CEC
2009
IEEE
14 years 1 months ago
Performance assessment of the hybrid Archive-based Micro Genetic Algorithm (AMGA) on the CEC09 test problems
— In this paper, the performance assessment of the hybrid Archive-based Micro Genetic Algorithm (AMGA) on a set of bound-constrained synthetic test problems is reported. The hybr...
Santosh Tiwari, Georges Fadel, Patrick Koch, Kalya...
AUSAI
2005
Springer
13 years 11 months ago
Accelerating Real-Valued Genetic Algorithms Using Mutation-with-Momentum
: In a canonical genetic algorithm, the reproduction operators (crossover and mutation) are random in nature. The direction of the search carried out by the GA system is driven pur...
Luke Temby, Peter Vamplew, Adam Berry
WAIM
2010
Springer
13 years 4 months ago
Mining Contrast Inequalities in Numeric Dataset
Finding relational expressions which exist frequently in one class of data while not in the other class of data is an interesting work. In this paper, a relational expression of th...
Lei Duan, Jie Zuo, Tianqing Zhang, Jing Peng, Jie ...
GECCO
2011
Springer
248views Optimization» more  GECCO 2011»
12 years 9 months ago
Size-based tournaments for node selection
In genetic programming, the reproductive operators of crossover and mutation both require the selection of nodes from the reproducing individuals. Both unbiased random selection a...
Thomas Helmuth, Lee Spector, Brian Martin