Sciweavers

300 search results - page 5 / 60
» Adapting Representation in Genetic Programming
Sort
View
CEC
2011
IEEE
12 years 7 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow
GECCO
2009
Springer
109views Optimization» more  GECCO 2009»
14 years 2 months ago
Canonical representation genetic programming
Search spaces sampled by the process of Genetic Programming often consist of programs which can represent a function in many different ways. Thus, when the space is examined it i...
John R. Woodward, Ruibin Bai
ISCAS
2005
IEEE
136views Hardware» more  ISCAS 2005»
14 years 1 months ago
Economical passive filter synthesis using genetic programming based on tree representation
—In this work we propose a novel tree representation for RLC circuits. Genetic programming based on the tree representation is described and applied to passive filter synthesis p...
Hao-Sheng Hou, Shoou-Jinn Chang, Yan-Kuin Su
GECCO
2004
Springer
105views Optimization» more  GECCO 2004»
14 years 26 days ago
Softening the Structural Difficulty in Genetic Programming with TAG-Based Representation and Insertion/Deletion Operators
In a series of papers [3-8], Daida et. al. highlighted the difficulties posed to Genetic Programming (GP) by the complexity of the structural search space, and attributed the probl...
Nguyen Xuan Hoai, Robert I. McKay
EUROGP
2004
Springer
145views Optimization» more  EUROGP 2004»
14 years 26 days ago
Toward an Alternative Comparison between Different Genetic Programming Systems
In this paper, we use multi-objective techniques to compare different genetic programming systems, permitting our comparison to concentrate on the effect of representation and sepa...
Nguyen Xuan Hoai, Robert I. McKay, Daryl Essam, Hu...