Sciweavers

1130 search results - page 128 / 226
» Bandit-Based Genetic Programming
Sort
View
GECCO
2006
Springer
180views Optimization» more  GECCO 2006»
15 years 1 months ago
Growth of self-canceling code in evolutionary systems
This research examines the behavior of inoperative code (introns) in the evolution of genetically robust solutions. Genetically robust solutions are solutions that are less likely...
Xue Zhong, Terence Soule
ISSRE
2000
IEEE
15 years 2 months ago
Building Trust into OO Components Using a Genetic Analogy
Despite the growing interest for component-based systems, few works tackle the question of the trust we can bring into a component. This paper presents a method and a tool for bui...
Benoit Baudry, Vu Le Hanh, Jean-Marc Jéz&ea...
GECCO
2009
Springer
148views Optimization» more  GECCO 2009»
15 years 4 months ago
An evolutionary approach to constructive induction for link discovery
This paper presents a genetic programming-based symbolic regression approach to the construction of relational features in link analysis applications. Specifically, we consider t...
Tim Weninger, William H. Hsu, Jing Xia, Waleed Alj...
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
15 years 1 months ago
Algebraic simplification of GP programs during evolution
Program bloat is a fundamental problem in the field of Genetic Programming (GP). Exponential growth of redundant and functionally useless sections of programs can quickly overcome...
Phillip Wong, Mengjie Zhang
PPSN
1994
Springer
15 years 1 months ago
An Evolutionary Algorithm for Integer Programming
Abstract. The mutation distribution of evolutionary algorithms usually is oriented at the type of the search space. Typical examples are binomial distributions for binary strings i...
Günter Rudolph