Sciweavers

1725 search results - page 258 / 345
» Relaxed genetic programming
Sort
View
JMLR
2012
13 years 10 days ago
Bayesian regularization of non-homogeneous dynamic Bayesian networks by globally coupling interaction parameters
To relax the homogeneity assumption of classical dynamic Bayesian networks (DBNs), various recent studies have combined DBNs with multiple changepoint processes. The underlying as...
Marco Grzegorczyk, Dirk Husmeier
CGO
2009
IEEE
15 years 4 months ago
Automatic Feature Generation for Machine Learning Based Optimizing Compilation
Recent work has shown that machine learning can automate and in some cases outperform hand crafted compiler optimizations. Central to such an approach is that machine learning tec...
Hugh Leather, Edwin V. Bonilla, Michael O'Boyle
EVOW
2009
Springer
15 years 4 months ago
Evolving Simple Art-Based Games
Evolutionary art has a long and distinguished history, and genetic programming is one of only a handful of AI techniques which is used in graphic design and the visual arts. A rece...
Simon Colton, Cameron Browne
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
15 years 3 months ago
A statistical learning theory approach of bloat
Code bloat, the excessive increase of code size, is an important issue in Genetic Programming (GP). This paper proposes a theoretical analysis of code bloat in the framework of sy...
Sylvain Gelly, Olivier Teytaud, Nicolas Bredeche, ...
BMCBI
2005
119views more  BMCBI 2005»
14 years 9 months ago
GASH: An improved algorithm for maximizing the number of equivalent residues between two protein structures
Background: We introduce GASH, a new, publicly accessible program for structural alignment and superposition. Alignments are scored by the Number of Equivalent Residues (NER), a q...
Daron M. Standley, Hiroyuki Toh, Haruki Nakamura