Sciweavers

3025 search results - page 127 / 605
» Automatic Programming of Robots Using Genetic Programming
Sort
View
IWPC
1999
IEEE
15 years 7 months ago
The SPARAMAT Approach to Automatic Comprehension of Sparse Matrix Computations
Automatic program comprehension is particularly useful when applied to sparse matrix codes, since it allows to abstract e.g. from specific sparse matrix storage formats used in th...
Christoph W. Keßler, Craig Smith
GECCO
2003
Springer
156views Optimization» more  GECCO 2003»
15 years 8 months ago
Facts and Fallacies in Using Genetic Algorithms for Learning Clauses in First-Order Logic
Over the last few years, a few approaches have been proposed aiming to combine genetic and evolutionary computation (GECCO) with inductive logic programming (ILP). The underlying r...
Flaviu Adrian Marginean
GECCO
2005
Springer
266views Optimization» more  GECCO 2005»
15 years 8 months ago
Total synthesis of algorithmic chemistries
Algorithmic Chemistries are Artificial Chemistries that aim at algorithms. In this contribution we present a new algorithm to execute Algorithmic Chemistries during evolution. Th...
Christian Lasarczyk, Wolfgang Banzhaf
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
15 years 9 months ago
Distribution replacement: how survival of the worst can out perform survival of the fittest
A new family of "Distribution Replacement” operators for use in steady state genetic algorithms is presented. Distribution replacement enforces the members of the populatio...
Howard Tripp, Phil Palmer
GECCO
2007
Springer
177views Optimization» more  GECCO 2007»
15 years 9 months ago
On the behavioral diversity of random programs
Generating a random sampling of program trees with specified function and terminal sets is the initial step of many program evolution systems. I present a theoretical and experim...
Moshe Looks