150 search results - page 6 / 30 » Numeric Mutation: Improved Search in Genetic Programming |
IJIT
2004
14 years 11 months ago
2004
In this contribution, a way to enhance the performance of the classic Genetic Algorithm is proposed. The idea of restarting a Genetic Algorithm is applied in order to obtain better...
PPSN
2000
Springer
15 years 1 months ago
2000
Springer
A family of recombination operators is studied in this work. These operators are based on keeping and using certain information about the past evolution of the algorithm to guide t...
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
Satisfiability testing (SAT) is a very active area of research today, with numerous real-world applications. We describe CLASS2.0, a genetic programming system for semi-automatica...
104
click to vote
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
Evolutionary Algorithms (EAs) have been largely applied to optimisation and synthesis of controllers. In spite of several successful applications and competitive solutions, the st...
SCAM
2008
IEEE
15 years 4 months ago
2008
IEEE
Traditional mutation testing considers only first order mutants, created by the injection of a single fault. Often these first order mutants denote trivial faults that are easil...