Characterizing crossover in genetic algorithms.
From MaRDI portal
Recommendations
Cited in
(21)- scientific article; zbMATH DE number 1931941 (Why is no real title available?)
- Crossing over genetic algorithms: the Sugal generalised GA
- A Markov chain that models genetic algorithms in noisy environments
- Markov chain analysis of genetic algorithms applied to fitness functions perturbed concurrently by additive and multiplicative noise
- scientific article; zbMATH DE number 2040669 (Why is no real title available?)
- Exact computation of the expectation surfaces for uniform crossover along with bit-flip mutation
- Phase transitions and symmetry breaking in genetic algorithms with crossover
- A taxonomy for the crossover operator for real-coded genetic algorithms: An experimental study
- Fitting the control parameters of a genetic algorithm: an application to technical trading systems design
- scientific article; zbMATH DE number 1864523 (Why is no real title available?)
- Separation axioms under crossover operator and its generalized
- Transit sets of two-point crossover
- Rate of convergence of crossover operators
- An analysis of an embedded crossover scheme on a GA-hard problem
- scientific article; zbMATH DE number 1784069 (Why is no real title available?)
- scientific article; zbMATH DE number 1928645 (Why is no real title available?)
- Tracking primary hyperplane competitors during genetic search
- scientific article; zbMATH DE number 2202066 (Why is no real title available?)
- A proof of the Vose-Liepins conjecture
- Metaheuristics: A bibliography
- Transit sets of \(k\)-point crossover operators
This page was built for publication: Characterizing crossover in genetic algorithms.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1354016)