When Will a Genetic Algorithm Outperform Hill Climbing?
Proceedings of the 5th International Conference on Genetic Algorithms
PPSN III Proceedings of the International Conference on Evolutionary Computation. The Third Conference on Parallel Problem Solving from Nature: Parallel Problem Solving from Nature
On the analysis of the (1+ 1) evolutionary algorithm
Theoretical Computer Science
Evolution strategies –A comprehensive introduction
Natural Computing: an international journal
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
On the Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Towards an analytic framework for analysing the computation time of evolutionary algorithms
Artificial Intelligence
Local and global order 3/2 convergence of a surrogate evolutionary algorithm
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Some theoretical results about the computation time of evolutionary algorithms
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
On the analysis of the (1+1) memetic algorithm
Proceedings of the 8th annual conference on Genetic and evolutionary computation
Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem
Theoretical Computer Science
Rigorous analyses of simple diversity mechanisms
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Speeding up evolutionary algorithms through asymmetric mutation operators
Evolutionary Computation
Rigorous hitting times for binary mutations
Evolutionary Computation
Comparing global and local mutations on bit strings
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Rigorous analyses of fitness-proportional selection for optimizing linear functions
Proceedings of the 10th annual conference on Genetic and evolutionary computation
A new approach to estimating the expected first hitting time of evolutionary algorithms
Artificial Intelligence
About the Time Complexity of Evolutionary Algorithms Based on Finite Search Space
Computational Intelligence and Security
On the choice of the parent population size*
Evolutionary Computation
About the Computation Time of Adaptive Evolutionary Algorithms
ISICA '08 Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence
Computing single source shortest paths using single-objective fitness
Proceedings of the tenth ACM SIGEVO workshop on Foundations of genetic algorithms
Comparison of simple diversity mechanisms on plateau functions
Theoretical Computer Science
The impact of parametrization in memetic evolutionary algorithms
Theoretical Computer Science
Maximal age in randomized search heuristics with aging
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
A pheromone-rate-based analysis on the convergence time of ACO algorithm
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics - Special issue on cybernetics and cognitive informatics
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Quantifying ruggedness of continuous landscapes using entropy
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Adaptive population models for offspring populations and parallel evolutionary algorithms
Proceedings of the 11th workshop proceedings on Foundations of genetic algorithms
Analysis of (1+1) evolutionary algorithm and randomized local search with memory
Evolutionary Computation
Algorithms (x, sigma, eta): quasi-random mutations for evolution strategies
EA'05 Proceedings of the 7th international conference on Artificial Evolution
Running time analysis of a multiobjective evolutionary algorithm on simple and hard problems
FOGA'05 Proceedings of the 8th international conference on Foundations of Genetic Algorithms
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
A Best Fit Relocation Approach for Heterogeneous Sensor Networks
Wireless Personal Communications: An International Journal
Finite Markov Chain Results in Evolutionary Computation: A Tour d'Horizon
Fundamenta Informaticae
| Hi-index | 0.00 |
It is shown by means of Markov chain analysis that unimodal binary long-path problems can be solved by mutation and elitist selection in a polynomially bounded number of trials on average.