On the analysis of the (1+ 1) evolutionary algorithm
Theoretical Computer Science
Evolution strategies –A comprehensive introduction
Natural Computing: an international journal
How to analyse evolutionary algorithms
Theoretical Computer Science - Natural computing
Fitness Landscapes Based on Sorting and Shortest Paths Problems
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
On the Expected Runtime and the Success Probability of Evolutionary Algorithms
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
The Cooperative Coevolutionary (1+1) EA
Evolutionary Computation
Properties of Gray and Binary Representations
Evolutionary Computation
A Study of Fitness Distance Correlation as a Difficulty Measure in Genetic Programming
Evolutionary Computation
On the analysis of the (1+1) memetic algorithm
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Mutation-crossover isomorphisms and the construction of discriminating functions
Evolutionary Computation
How mutation and selection solve long-path problems in polynomial expected time
Evolutionary Computation
Adapting operator settings in genetic algorithms
Evolutionary Computation
Comparing global and local mutations on bit strings
Proceedings of the 10th annual conference on Genetic and evolutionary computation
On the choice of the parent population size*
Evolutionary Computation
Analysis of adaptive operator selection techniques on the royal road and long k-path problems
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Maximal age in randomized search heuristics with aging
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Node level crossover applied to neural network evolution
IWANN'03 Proceedings of the Artificial and natural neural networks 7th international conference on Computational methods in neural modeling - Volume 1
Analysis of computational time of simple estimation of distribution algorithms
IEEE Transactions on Evolutionary Computation
Optimizing monotone functions can be difficult
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Towards a complexity theory of randomized search heuristics: ranking-based black-box complexity
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Average time complexity of estimation of distribution algorithms
IWANN'05 Proceedings of the 8th international conference on Artificial Neural Networks: computational Intelligence and Bioinspired Systems
On the effect of connectedness for biobjective multiple and long path problems
LION'05 Proceedings of the 5th international conference on Learning and Intelligent Optimization
Finite Markov Chain Results in Evolutionary Computation: A Tour d'Horizon
Fundamenta Informaticae
Revisiting the Memory of Evolution
Fundamenta Informaticae
Mutation rate matters even when optimizing monotonic functions
Evolutionary Computation
Hi-index | 0.00 |