74 search results - page 5 / 15 » An Analysis of Automatic Subroutine Discovery in Genetic Pro... |
EUROGP
2004
Springer
14 years 3 days ago
2004
Springer
The paper presents for the first time automatic module acquisition and evolution within the graph based Cartesian Genetic Programming method. The method has been tested on a set of...
EICS
2010
ACM
13 years 11 months ago
2010
ACM
UI model discovery is a lightweight formal method in which a model of an interactive system is automatically discovered by exploring the system’s state space, simulating the act...
EC
2008
13 years 6 months ago
2008
The development of successful metaheuristic algorithms such as local search for a difficult problems such as satisfiability testing (SAT) is a challenging task. We investigate an ...
CEC
2011
IEEE
12 years 6 months ago
2011
IEEE
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
ICSE
2005
IEEE-ACM
14 years 6 months ago
2005
IEEE-ACM
We argue that finding vulnerabilities in software components is different from finding exploits against them. Exploits that compromise security often use several low-level details...