The complexity of Boolean functions
The complexity of Boolean functions
Branching programs and binary decision diagrams: theory and applications
Branching programs and binary decision diagrams: theory and applications
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 Optimization of Monotone Polynomials by Simple Randomized Search Heuristics
Combinatorics, Probability and Computing
Minimum spanning trees made easier via multi-objective optimization
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
On the local performance of simulated annealing and the (1+1) evolutionary algorithm
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Upper and Lower Bounds for Randomized Search Heuristics in Black-Box Optimization
Theory of Computing Systems
Precision, local search and unimodal functions
Proceedings of the 10th annual conference on Genetic and evolutionary computation
| Hi-index | 0.00 |