381 search results - page 9 / 77 » Time Complexity of genetic algorithms on exponentially scale... |
GECCO
2006
Springer
13 years 11 months ago
2006
Springer
This work shows asymptotic convergence to global optima for a family of dynamically scaled genetic programming systems where the underlying population consists of a fixed number o...
ICASSP
2010
IEEE
13 years 7 months ago
2010
IEEE
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...
GECCO
2004
Springer
14 years 1 months ago
2004
Springer
A model of the dynamics of solving the counting-ones (OneMax) problem using a simple genetic algorithm (GA) is developed. It uses statistics of the early generations of GA runs to ...
RECOMB
2006
Springer
14 years 8 months ago
2006
Springer
Abstract. Preliminary to most comparative genomics studies is the annotation of chromosomes as ordered sequences of genes. Unfortunately, different genetic mapping techniques usual...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— We consider a scenario where a wireless sensor network is formed by randomly deploying n sensors to measure some spatial function over a field, with the objective of computing...