A connectionist machine for genetic hillclimbing
A connectionist machine for genetic hillclimbing
Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control and Artificial Intelligence
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Numerical Optimization of Computer Models
Numerical Optimization of Computer Models
A New Interpretation of Schema Notation that Overtums the Binary Encoding Constraint
Proceedings of the 3rd International Conference on Genetic Algorithms
Optimal Mutation Rates in Genetic Search
Proceedings of the 5th International Conference on Genetic Algorithms
Proceedings of the 5th International Conference on Genetic Algorithms
A Markov Chain Analysis on A Genetic Algorithm
Proceedings of the 5th International Conference on Genetic Algorithms
Fitness Distance Correlation as a Measure of Problem Difficulty for Genetic Algorithms
Proceedings of the 6th International Conference on Genetic Algorithms
Global Convergence of Genetic Algorithms: A Markov Chain Analysis
PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
Formal Algorithms + Formal Representations = Search Strategies
PPSN IV Proceedings of the 4th International Conference on Parallel Problem Solving from Nature
Intelligent Mutation Rate Control in Canonical Genetic Algorithms
ISMIS '96 Proceedings of the 9th International Symposium on Foundations of Intelligent Systems
An Asymptotic Theory of Genetic Algorithms
AE '95 Selected Papers from the European conference on Artificial Evolution
Genetic Algorithms: Minimal Conditions for Convergence
AE '97 Selected Papers from the Third European Conference on Artificial Evolution
AE '97 Selected Papers from the Third European Conference on Artificial Evolution
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Handbook of Mathematical Functions, With Formulas, Graphs, and Mathematical Tables,
Toward a theory of evolution strategies: Some asymptotical results from the (1,+ λ)-theory
Evolutionary Computation
A markov chain framework for the simple genetic algorithm
Evolutionary Computation
Toward a theory of evolution strategies: The (μ, λ)-theory
Evolutionary Computation
Toward a theory of evolution strategies: On the benefits of sex---the (μ/μ, λ) theory
Evolutionary Computation
Toward a theory of evolution strategies: Self-adaptation
Evolutionary Computation
Analysis of selection algorithms: A markov chain approach
Evolutionary Computation
How mutation and selection solve long-path problems in polynomial expected time
Evolutionary Computation
On the analysis of the (1+ 1) evolutionary algorithm
Theoretical Computer Science
How to analyse evolutionary algorithms
Theoretical Computer Science - Natural computing
On the Choice of the Mutation Probability for the (1+1) EA
PPSN VI Proceedings of the 6th International Conference on Parallel Problem Solving from Nature
On the Analysis of Dynamic Restart Strategies for Evolutionary Algorithms
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Theoretical Aspects of Evolutionary Algorithms
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Towards an analytic framework for analysing the computation time of evolutionary algorithms
Artificial Intelligence
On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics
Combinatorics, Probability and Computing
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
Theoretical Analysis of Mutation-Adaptive Evolutionary Algorithms
Evolutionary Computation
The Cooperative Coevolutionary (1+1) EA
Evolutionary Computation
Runtime Analysis of the (μ+1) EA on Simple Pseudo-Boolean Functions
Evolutionary Computation
Analysis of a multiobjective evolutionary algorithm on the 0-1 knapsack problem
Theoretical Computer Science
An evolutionary machine learning: An adaptability perspective at fine granularity
International Journal of Knowledge-based and Intelligent Engineering Systems
Stability in the self-organized evolution of networks
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Theoretical Computer Science
Population size versus runtime of a simple evolutionary algorithm
Theoretical Computer Science
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
Multiobjectivization by Decomposition of Scalar Cost Functions
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation
Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
A comparative runtime analysis of heuristic algorithms for satisfiability problems
Artificial Intelligence
Scaling of program functionality
Genetic Programming and Evolvable Machines
About the Computation Time of Adaptive Evolutionary Algorithms
ISICA '08 Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence
A new approach to estimating the expected first hitting time of evolutionary algorithms
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Preserving and exploiting genetic diversity in evolutionary programming algorithms
IEEE Transactions on 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
Analysis of an asymmetric mutation operator
Evolutionary Computation
When to use bit-wise neutrality
Natural Computing: an international journal
Exploring the explorative advantage of the cooperative coevolutionary (1+1) EA
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
On the optimization of monotone polynomials by the (1+1) EA and randomized local search
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartI
Comparing variants of MMAS ACO algorithms on pseudo-boolean functions
SLS'07 Proceedings of the 2007 international conference on Engineering stochastic local search algorithms: designing, implementing and analyzing effective heuristics
On the running time analysis of the (1+1) evolutionary algorithm for the subset sum problem
LSMS'07 Proceedings of the Life system modeling and simulation 2007 international conference on Bio-Inspired computational intelligence and applications
Using markov-chain mixing time estimates for the analysis of ant colony optimization
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
Finding mount everest and handling voids
Evolutionary Computation
Mutation rates of the (1+1)-EA on pseudo-boolean functions of bounded epistasis
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Algorithms (x, sigma, eta): quasi-random mutations for evolution strategies
EA'05 Proceedings of the 7th international conference on Artificial Evolution
A comparison of simulated annealing with a simple evolutionary algorithm
FOGA'05 Proceedings of the 8th international conference on Foundations of Genetic Algorithms
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
Problem understanding through landscape theory
Proceedings of the 15th annual conference companion on Genetic and evolutionary computation
| Hi-index | 0.00 |
In the binary evolutionary optimization framework, two mutation operators are theoretically investigated. For both the standard mutation, in which all bits are flipped independently with the same probability, and the 1-bit-flip mutation, which flips exactly one bit per bitstring, the statistical distribution of the first hitting times of the target are thoroughly computed (expectation and variance) up to terms of order l (the size of the bitstrings) in two distinct situations: without any selection, or with the deterministic (1 + l)-ES selection on the OneMax problem. In both cases, the 1-bit-flip mutation convergence time is smaller by a constant (in terms of l) multiplicative factor. These results extend to the case of multiple independent optimizers.