Sciweavers

844 search results - page 94 / 169
» Generalized crowding for genetic algorithms
Sort
View
KBSE
2007
IEEE
15 years 4 months ago
Nighthawk: a two-level genetic-random unit test data generator
Randomized testing has been shown to be an effective method for testing software units. However, the thoroughness of randomized unit testing varies widely according to the settin...
James H. Andrews, Felix Chun Hang Li, Tim Menzies
GECCO
2007
Springer
187views Optimization» more  GECCO 2007»
15 years 4 months ago
Defining implicit objective functions for design problems
In many design tasks it is difficult to explicitly define an objective function. This paper uses machine learning to derive an objective in a feature space based on selected examp...
Sean Hanna
GECCO
2007
Springer
159views Optimization» more  GECCO 2007»
15 years 4 months ago
A systemic computation platform for the modelling and analysis of processes with natural characteristics
Computation in biology and in conventional computer architectures seem to share some features, yet many of their important characteristics are very different. To address this, [1]...
Erwan Le Martelot, Peter J. Bentley, R. Beau Lotto
GECCO
2005
Springer
153views Optimization» more  GECCO 2005»
15 years 3 months ago
Evolving neural network ensembles for control problems
In neuroevolution, a genetic algorithm is used to evolve a neural network to perform a particular task. The standard approach is to evolve a population over a number of generation...
David Pardoe, Michael S. Ryoo, Risto Miikkulainen
GECCO
2005
Springer
119views Optimization» more  GECCO 2005»
15 years 3 months ago
Improving GA search reliability using maximal hyper-rectangle analysis
In Genetic algorithms it is not easy to evaluate the confidence level in whether a GA run may have missed a complete area of good points, and whether the global optimum was found....
Chongshan Zhang, Khaled Rasheed