3750 search results - page 641 / 750 » Code Optimization for Code Compression |
168
Voted
EUROGP
1998
Springer
15 years 7 months ago
1998
Springer
The problem of evolving, using mutation, an artificial ant to follow the Santa Fe trail is used to study the well known genetic programming feature of growth in solution length. Kn...
168
Voted
CASES
2007
ACM
15 years 6 months ago
2007
ACM
With increasing complexity of modern embedded systems, the availability of highly optimizing compilers becomes more and more important. At the same time, application specific inst...
143
Voted
GECCO
2007
Springer
15 years 6 months ago
2007
Springer
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...
120
Voted
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
In this work, we employed genetic programming to evolve a "white hat" attacker; that is to say, we evolve variants of an attack with the objective of providing better de...
106
click to vote
GECCO
2006
Springer
15 years 6 months ago
2006
Springer
Program bloat is a fundamental problem in the field of Genetic Programming (GP). Exponential growth of redundant and functionally useless sections of programs can quickly overcome...