Sciweavers

1725 search results - page 15 / 345
» Relaxed genetic programming
Sort
View
CEC
2010
IEEE
13 years 7 months ago
Genetic programming for Expert Systems
— Genetic programming is the usage of the paradigm of survival of the fittest in scientific computing. It is applied to evolve solutions to problems where dependencies between ...
Konrad Sickel, Joachim Hornegger
ECCV
2010
Springer
14 years 20 days ago
MRF Inference by k-Fan Decomposition and Tight Lagrangian Relaxation
We present a novel dual decomposition approach to MAP inference with highly connected discrete graphical models. Decompositions into cyclic k-fan structured subproblems are shown t...
GECCO
2006
Springer
218views Optimization» more  GECCO 2006»
13 years 11 months ago
A survey of mutation techniques in genetic programming
The importance of mutation varies across evolutionary computation domains including: genetic programming, evolution strategies, and genetic algorithms. In the genetic programming ...
Alan Piszcz, Terence Soule
GECCO
2006
Springer
143views Optimization» more  GECCO 2006»
13 years 11 months ago
Heterogeneous cooperative coevolution: strategies of integration between GP and GA
Cooperative coevolution has proven to be a promising technique for solving complex combinatorial optimization problems. In this paper, we present four different strategies which i...
Leonardo Vanneschi, Giancarlo Mauri, Andrea Valsec...
EUROGP
2003
Springer
173views Optimization» more  EUROGP 2003»
14 years 25 days ago
Tree Adjoining Grammars, Language Bias, and Genetic Programming
In this paper, we introduce a new grammar guided genetic programming system called tree-adjoining grammar guided genetic programming (TAG3P+), where tree-adjoining grammars (TAGs) ...
Nguyen Xuan Hoai, Robert I. McKay, Hussein A. Abba...