Sciweavers

1725 search results - page 143 / 345
» Relaxed genetic programming
Sort
View
EUROGP
2006
Springer
140views Optimization» more  EUROGP 2006»
15 years 2 months ago
Evolving Noisy Oscillatory Dynamics in Genetic Regulatory Networks
We introduce a genetic programming (GP) approach for evolving genetic networks that demonstrate desired dynamics when simulated as a discrete stochastic process. Our representation...
André Leier, P. Dwight Kuo, Wolfgang Banzha...
GPEM
2008
116views more  GPEM 2008»
14 years 10 months ago
An Eigen analysis of the GP community
The coauthorship and coeditorship relations as recorded in the genetic programming bibliography provide a quantitative view of the GP community. Eigen analysis is used to find the ...
William B. Langdon, Riccardo Poli, Wolfgang Banzha...
ICML
2007
IEEE
15 years 11 months ago
What is decreased by the max-sum arc consistency algorithm?
Inference tasks in Markov random fields (MRFs) are closely related to the constraint satisfaction problem (CSP) and its soft generalizations. In particular, MAP inference in MRF i...
Tomás Werner
BMCBI
2005
67views more  BMCBI 2005»
14 years 10 months ago
Selecting additional tag SNPs for tolerating missing data in genotyping
Background: Recent studies have shown that the patterns of linkage disequilibrium observed in human populations have a block-like structure, and a small subset of SNPs (called tag...
Yao-Ting Huang, Kui Zhang, Ting Chen, Kun-Mao Chao
ECAI
2010
Springer
14 years 12 months ago
Nested Monte-Carlo Expression Discovery
Nested Monte-Carlo search is a general algorithm that gives good results in single player games. Genetic Programming evaluates and combines trees to discover expressions that maxim...
Tristan Cazenave