Linear analysis of genetic algorithms
From MaRDI portal
Publication:1276251
DOI10.1016/S0304-3975(98)00004-8zbMath0917.68190MaRDI QIDQ1276251
Lothar M. Schmitt, Robert H. Fujii, Chrystopher L. Nehaniv
Publication date: 20 January 1999
Published in: Theoretical Computer Science (Search for Journal in Brave)
Learning and adaptive systems in artificial intelligence (68T05) Parallel algorithms in computer science (68W10)
Related Items
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 ⋮ The effect of multiple optima on the simple GA run-time complexity ⋮ An effective hybrid optimization strategy for job-shop scheduling problems ⋮ Theory of genetic algorithms
Cites Work
- Nonstationary Markov chains and convergence of the annealing algorithm
- Modeling genetic algorithms with Markov chains.
- Non-negative matrices and Markov chains.
- On weak and monotone \(\sigma\)-closures of \(C^ *\)-algebras
- Convergence and finite-time behavior of simulated annealing
- Simulated annealing: An introduction
- Equation of State Calculations by Fast Computing Machines
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item