Transition functions for evolutionary algorithms on continuous state-space
From MaRDI portal
Publication:2643725
Recommendations
- On some theoretical properties of \((1+1)\) evolutionary algorithms
- Evolutionary algorithms for continuous-space optimisation
- Algorithmic analysis of a basic evolutionary algorithm for continuous optimization
- On the analysis of the \((1+1)\) evolutionary algorithm
- How to analyse evolutionary algorithms.
Cites work
- Finite Markov Chains and Algorithmic Applications
- General Irreducible Markov Chains and Non-Negative Operators
- scientific article; zbMATH DE number 1664952 (Why is no real title available?)
- scientific article; zbMATH DE number 3459735 (Why is no real title available?)
- On Linear Convergence of a Class of Random Search Algorithms
- On the analysis of the \((1+1)\) evolutionary algorithm
- Simulated annealing process in general state space
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
Cited in
(6)- State transition algorithm
- Convergence of a New Evolutionary Computing Algorithm in Continuous State Space
- Evolutionary algorithms for continuous-space optimisation
- On some theoretical properties of \((1+1)\) evolutionary algorithms
- Continuous Optimisation Theory Made Easy? Finite-Element Models of Evolutionary Strategies, Genetic Algorithms and Particle Swarm Optimizers
- Estimation of distribution algorithms on non-separable problems
This page was built for publication: Transition functions for evolutionary algorithms on continuous state-space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2643725)
