Sciweavers

602 search results - page 38 / 121
» Unsupervised Problem Decomposition Using Genetic Programming
Sort
View
CEC
2008
IEEE
14 years 11 months ago
Subtree deactivation control with grammatical Genetic Programming in dynamic environments
Abstract-- We investigate the usefulness of a subtree deactivation control mechanism which is open to evolutionary learning. It is hypothesised that this representation confers an ...
Michael O'Neill, Anthony Brabazon, Erik Hemberg
ICALP
2010
Springer
15 years 2 months ago
Dynamic Programming for Graphs on Surfaces
Abstract. We provide a framework for the design and analysis of dynamic programming algorithms for surface-embedded graphs on n vertices and branchwidth at most k. Our technique ap...
Juanjo Rué, Ignasi Sau, Dimitrios M. Thilik...
GECCO
2006
Springer
202views Optimization» more  GECCO 2006»
15 years 1 months ago
Evolving hash functions by means of genetic programming
The design of hash functions by means of evolutionary computation is a relatively new and unexplored problem. In this work, we use Genetic Programming (GP) to evolve robust and fa...
César Estébanez, Julio César ...
GECCO
2011
Springer
274views Optimization» more  GECCO 2011»
14 years 1 months ago
Fuzzy dynamical genetic programming in XCSF
—A number of representation schemes have been presented for use within Learning Classifier Systems, ranging from binary encodings to Neural Networks, and more recently Dynamical ...
Richard Preen, Larry Bull
GECCO
2006
Springer
215views Optimization» more  GECCO 2006»
15 years 1 months ago
A multi-chromosome approach to standard and embedded cartesian genetic programming
Embedded Cartesian Genetic Programming (ECGP) is an extension of Cartesian Genetic Programming (CGP) that can automatically acquire, evolve and re-use partial solutions in the for...
James Alfred Walker, Julian Francis Miller, Rachel...