550 search results - page 7 / 110 » A simple and effective algorithm for the MaxMin diversity pr... |
CEC
2005
IEEE
14 years 1 months ago
2005
IEEE
This paper proposes a genetic algorithm (GA) with random immigrants for dynamic optimization problems where the worst individual and its neighbours are replaced every generation. I...
ESANN
2006
13 years 9 months ago
2006
We consider a blind separation problem for undetermined mixtures of two BPSK signals in a multi-path fading channel. We use independence and frequency diversity of the two source s...
GECCO
2008
Springer
13 years 8 months ago
2008
Springer
Maintaining diversity is important for the performance of evolutionary algorithms. Diversity mechanisms can enhance global exploration of the search space and enable crossover to ...
ECAL
2003
Springer
14 years 23 days ago
2003
Springer
Coevolutionary optimisation suffers from a series of problems that interfere with the progressive escalating arms races that are hoped might solve difficult classes of optimisatio...
ICASSP
2009
IEEE
14 years 2 months ago
2009
IEEE
The common zeros problem for blind system identification (BSI) is well known. It degrades the performance of classic BSI algorithms and therefore imposes the limit on the perform...