Sciweavers

18 search results - page 2 / 4
» An empirical analysis of the grouping genetic algorithm: the...
Sort
View
TSE
2010
136views more  TSE 2010»
13 years 3 months ago
A Theoretical and Empirical Study of Search-Based Testing: Local, Global, and Hybrid Search
Search based optimization techniques have been applied to structural software test data generation since 1992, with a recent upsurge in interest and activity within this area. How...
Mark Harman, Phil McMinn
GECCO
2008
Springer
126views Optimization» more  GECCO 2008»
13 years 6 months ago
The impact of population size on code growth in GP: analysis and empirical validation
The crossover bias theory for bloat [18] is a recent result which predicts that bloat is caused by the sampling of short, unfit programs. This theory is clear and simple, but it ...
Riccardo Poli, Nicholas Freitag McPhee, Leonardo V...
GECCO
2000
Springer
138views Optimization» more  GECCO 2000»
13 years 9 months ago
Time Complexity of genetic algorithms on exponentially scaled problems
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
Fernando G. Lobo, David E. Goldberg, Martin Pelika...
JMLR
2012
11 years 8 months ago
Structured Sparse Canonical Correlation Analysis
In this paper, we propose to apply sparse canonical correlation analysis (sparse CCA) to an important genome-wide association study problem, eQTL mapping. Existing sparse CCA mode...
Xi Chen, Han Liu, Jaime G. Carbonell
GECCO
2010
Springer
207views Optimization» more  GECCO 2010»
13 years 10 months ago
Generalized crowding for genetic algorithms
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
Severino F. Galán, Ole J. Mengshoel