Sciweavers

150 search results - page 5 / 30
» Numeric Mutation: Improved Search in Genetic Programming
Sort
View
GECCO
2000
Springer
121views Optimization» more  GECCO 2000»
15 years 1 months ago
Informed operators: Speeding up genetic-algorithm-based design optimization using reduced models
In this paper we describe a method for improving genetic-algorithm-based optimization using informed genetic operators. The idea is to make the genetic operators such as mutation ...
Khaled Rasheed, Haym Hirsh
FOGA
2011
14 years 1 months ago
Computational complexity analysis of simple genetic programming on two problems modeling isolated program semantics
Analyzing the computational complexity of evolutionary algorithms (EAs) for binary search spaces has significantly informed our understanding of EAs in general. With this paper, ...
Greg Durrett, Frank Neumann, Una-May O'Reilly
GECCO
2007
Springer
176views Optimization» more  GECCO 2007»
15 years 3 months ago
Best SubTree genetic programming
The result of the program encoded into a Genetic Programming (GP) tree is usually returned by the root of that tree. However, this is not a general strategy. In this paper we pres...
Oana Muntean, Laura Diosan, Mihai Oltean
CEC
2010
IEEE
14 years 9 months ago
Genetic programming for Expert Systems
— Genetic programming is the usage of the paradigm of survival of the fittest in scientific computing. It is applied to evolve solutions to problems where dependencies between ...
Konrad Sickel, Joachim Hornegger
TOOLS
2000
IEEE
15 years 1 months ago
Testing-for-Trust: The Genetic Selection Model Applied to Component Qualification
This paper presents a method and a tool for building trustable OO components. The methodology is based on an integrated design and test approach for OO software components. It is ...
Benoit Baudry, Vu Le Hanh, Yves Le Traon