Sciweavers

1162 search results - page 128 / 233
» Cartesian genetic programming
Sort
View
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
14 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
JCB
2000
137views more  JCB 2000»
13 years 10 months ago
NOTUNG: A Program for Dating Gene Duplications and Optimizing Gene Family Trees
Large scale gene duplication is a major force driving the evolution of genetic functional innovation. Whole genome duplications are widely believed to have played an important rol...
Kevin Chen, Dannie Durand, Martin Farach-Colton
ESOP
2000
Springer
14 years 1 months ago
Polyvariant Flow Analysis with Constrained Types
Abstract. The basic idea behind improving the quality of a monovariant control flow analysis such as 0CFA is the concept of polyvariant analyses such as Agesen's Cartesian Pro...
Scott F. Smith, Tiejun Wang
CORR
2007
Springer
98views Education» more  CORR 2007»
13 years 10 months ago
Bistable Biorders: A Sequential Domain Theory
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order — the ...
James Laird
PPSN
1994
Springer
14 years 2 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