14774 search results - page 59 / 2955 » Computational complexity and evolutionary computation |
135
Voted
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
In this work we present a novel and efficient algorithm– independent stopping criterion, called the MGBM criterion, suitable for Multiobjective Optimization Evolutionary Algorit...
117
Voted
GECCO
2006
Springer
15 years 7 months ago
2006
Springer
The use of genotypic populations is necessary for adaptation in Evolutionary Algorithms. We use a technique called form-invariant commutation to study the immediate effect of evol...
134
Voted
EUROCAST
2007
Springer
15 years 7 months ago
2007
Springer
RND (Radio Network Design) is an important problem in mobile telecommunications (for example in mobile/cellular telephony), being also relevant in the rising area of sensor network...
126
Voted
GECCO
2009
Springer
15 years 10 months ago
2009
Springer
In this paper, we rigorously analyse how the magnitude and frequency of change may affect the performance of the algorithm (1+1) EAdyn on a set of artificially designed pseudo-Bo...
163
Voted
EC
2011
14 years 7 months ago
2011
man and Kenneth O. Stanley (2010). Revising the Evolutionary Computation Abstraction: Minimal Criteria Novelty Search. In: Proceedings of the Genetic and Evolutionary Computation C...