Modeling genetic algorithms with Markov chains.
From MaRDI portal
Recommendations
Cited in
(84)- Linear analysis of genetic algorithms
- A Markov chain analysis of genetic algorithms with power of 2 cardinality alphabets
- A branching process model for genetic algorithms
- Optimizing epochal evolutionary search: population-size independent theory.
- Random heuristic search: applications to GAs and functions of unitation.
- A discipline of evolutionary programming
- Genetic algorithms, pseudo-random numbers generators, and Markov chain Monte Carlo methods
- On the convergence of biogeography-based optimization for binary problems
- Sorting by swaps with noisy comparisons
- Designing polymer blends using neural networks, genetic algorithms, and Markov chains
- Population aggregation based on fitness
- Application of Markov chains to linked genes with interference. II: Genotypic selection
- Global optimization with exploration/selection algorithms and simulated annealing
- Theory of genetic algorithms. II: Models for genetic operators over the string-tensor representation of populations and convergence to global optima for arbitrary fitness function under scaling
- Metaheuristics: A bibliography
- The algebra of genetic algorithms
- A proof of the Vose-Liepins conjecture
- A closer look at mutation in genetic algorithms
- A mathematical analysis of the long-run behavior of genetic algorithms for social modeling
- A Markov model of polygenic inheritance
- A self-adaptive migration model genetic algorithm for data mining applications
- A new approach to estimating the expected first hitting time of evolutionary algorithms
- Learning genetic algorithm parameters using hidden Markov models
- Backward-chaining evolutionary algorithms
- Phase transitions and symmetry breaking in genetic algorithms with crossover
- Some results about the Markov chains associated to GPs and general EAs
- Theoretical advances in artificial immune systems
- The unified method analyzing convergence of genetic algorithms
- Continuous dynamical system models of steady-state genetic algorithms
- Multistage non homogeneous Markov chain modeling of the non homogeneous genetic algorithm and convergence results
- A Markov chain analysis of genetic algorithms: large deviation principle approach
- Application of an interval adaptive genetic algorithm to solving Markov state transfer matrix
- Monotonicity of fitness landscapes and mutation rate control
- scientific article; zbMATH DE number 4154269 (Why is no real title available?)
- MODELLING THE DYNAMICS OF AN ADJUSTMENT OF A SEARCH SPACE SIZE IN A GENETIC ALGORITHM
- Genetic fitness optimization using rapidly mixing Markov chains
- An agent-based model of hierarchic genetic search
- Multistage Markov chain modeling of the genetic algorithm and convergence results
- Accelerated genetic algorithms with Markov chains
- THE PERFORMANCE OF GENETIC ALGORITHM WITH ADJUSTMENT OF A SEARCH SPACE
- THE DYNAMICS OF A CHANGING RANGE GENETIC ALGORITHM UNDER STABILIZING SELECTION
- Convergence conditions of genetic algorithms
- A Markov chain that models genetic algorithms in noisy environments
- scientific article; zbMATH DE number 1337869 (Why is no real title available?)
- Markov processes for modeling and analyzing a new genetic mapping method
- Finding all minimal elements of a finite partially ordered set by genetic algorithm with a prescribed probability
- scientific article; zbMATH DE number 711300 (Why is no real title available?)
- scientific article; zbMATH DE number 2013480 (Why is no real title available?)
- Markov chain analysis of self-organizing mobile nodes self-organizing mobile nodes
- scientific article; zbMATH DE number 1923171 (Why is no real title available?)
- scientific article; zbMATH DE number 2086437 (Why is no real title available?)
- scientific article; zbMATH DE number 2086833 (Why is no real title available?)
- PERFORMANCE EVALUATION OF GENETIC ALGORITHMS AND EVOLUTIONARY PROGRAMMING IN OPTIMIZATION AND MACHINE LEARNING
- scientific article; zbMATH DE number 1861615 (Why is no real title available?)
- scientific article; zbMATH DE number 798681 (Why is no real title available?)
- Theoretical analysis of steady state genetic algorithms
- Research on one random assortment model of chromosome
- An overview of schema theory
- Modified genetic algorithm-based clustering for probability density functions
- Application of a Markovian process to the calculation of mean time equilibrium in a genetic drift model
- The quasispecies regime for the simple genetic algorithm with ranking selection
- Modeling the genetic algorithm by a nonhomogeneous Markov chain: weak and strong ergodicity
- Dynamics of information and optimal control of mutation in evolutionary systems
- The island model as a Markov dynamic system
- Analytical and numerical comparisons of biogeography-based optimization and genetic algorithms
- Convergence of empirical processes for interacting particle systems with applications to nonlinear filtering
- New stopping criterion for genetic algorithms
- Theory of genetic algorithms
- Understanding measure-driven algorithms solving irreversibly ill-conditioned problems
- Practical performance models of algorithms in evolutionary program induction and other domains
- A unified framework for population-based metaheuristics
- Markov modelling and parameterisation of genetic evolutionary test generations
- Modeling genetic algorithms with interacting particle systems
- The dynamics of a genetic algorithm for simple random Ising systems
- Analysis and optimization of probabilities of beneficial mutation and crossover recombination in a Hamming space
- Markov model of sex-linked recessive trait transmission
- A genetic algorithm for task scheduling on heterogeneous computing systems using multiple priority queues
- Towards an analytic framework for analysing the computation time of evolutionary algorithms
- A comparative runtime analysis of heuristic algorithms for satisfiability problems
- A general steady state distribution based stopping criteria for finite length genetic algorithms
- The effect of multiple optima on the simple GA run-time complexity
- A genetic system based on simulated crossover of sequences of two-bit genes
- On initial populations of a genetic algorithm for continuous optimization problems
- A new genetic algorithm for solving nonconvex nonlinear programming problems
This page was built for publication: Modeling genetic algorithms with Markov chains.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1354022)
