Sciweavers

444 search results - page 52 / 89
» Solving Mastermind Using Genetic Algorithms
Sort
View
GECCO
2007
Springer
160views Optimization» more  GECCO 2007»
14 years 2 months ago
Self-modifying cartesian genetic programming
In nature, systems with enormous numbers of components (i.e. cells) are evolved from a relatively small genotype. It has not yet been demonstrated that artificial evolution is su...
Simon Harding, Julian Francis Miller, Wolfgang Ban...
FGCS
2010
119views more  FGCS 2010»
13 years 7 months ago
Characterizing fault tolerance in genetic programming
Evolutionary Algorithms, including Genetic Programming (GP), are frequently employed to solve difficult real-life problems, which can require up to days or months of computation. ...
Daniel Lombraña Gonzalez, Francisco Fern&aa...
GECCO
2004
Springer
284views Optimization» more  GECCO 2004»
14 years 2 months ago
Lagrange Multiplier Method for Multi-campaign Assignment Problem
It is crucial to maximize marketing efficiency and customer satisfaction in personalized marketing. In this paper, we raise the multiple recommendation problem which occurs when pe...
Yong-Hyuk Kim, Byung Ro Moon
GECCO
2009
Springer
103views Optimization» more  GECCO 2009»
14 years 3 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
JUCS
2002
179views more  JUCS 2002»
13 years 8 months ago
A Fast and Simple Algorithm for Constructing Minimal Acyclic Deterministic Finite Automata
: In this paper, we present a fast and simple algorithm for constructing a minimal acyclic deterministic finite automaton from a finite set of words. Such automata are useful in a ...
Bruce W. Watson