Sciweavers

1725 search results - page 28 / 345
» Relaxed genetic programming
Sort
View
GPEM
2000
121views more  GPEM 2000»
13 years 9 months 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
RECOMB
2010
Springer
14 years 4 months ago
On the Genealogy of Asexual Diploids
Given molecular genetic data from diploid individuals that, at present, reproduce mostly or exclusively asexually without recombination, an important problem in evolutionary biolog...
Fumei Lam, Charles H. Langley, Yun S. Song
FM
2009
Springer
95views Formal Methods» more  FM 2009»
14 years 2 months ago
On the Complexity of Synthesizing Relaxed and Graceful Bounded-Time 2-Phase Recovery
The problem of enforcing bounded-time 2-phase recovery in real-time programs is often necessitated by conflict between faulttolerance requirements and timing constraints. In this ...
Borzoo Bonakdarpour, Sandeep S. Kulkarni
GECCO
2005
Springer
189views Optimization» more  GECCO 2005»
14 years 3 months ago
Molecular programming: evolving genetic programs in a test tube
We present a molecular computing algorithm for evolving DNA-encoded genetic programs in a test tube. The use of synthetic DNA molecules combined with biochemical techniques for va...
Byoung-Tak Zhang, Ha-Young Jang
GECCO
2009
Springer
103views Optimization» more  GECCO 2009»
14 years 4 months ago
Why evolution is not a good paradigm for program induction: a critique of genetic programming
We revisit the roots of Genetic Programming (i.e. Natural Evolution), and conclude that the mechanisms of the process of evolution (i.e. selection, inheritance and variation) are ...
John R. Woodward, Ruibin Bai