A genetic system based on simulated crossover of sequences of two-bit genes

DOI10.1016/J.TCS.2006.09.007zbMATH Open1119.68145OpenAlexW2092000838MaRDI QIDQ857396FDOQ857396

Authors: M. Carpentieri 

Publication date: 14 December 2006

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2006.09.007

Recommendations

• A computational view of population genetics
• Theory of genetic algorithms
• Linear analysis of genetic algorithms
• Modeling genetic algorithms with Markov chains.
• The dynamics of a genetic algorithm for simple random Ising systems

zbMATH Keywords

marginal distribution genetic algorithmsMax-cut problem

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Nonnumerical algorithms (68W05)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Neural networks and physical systems with emergent collective computational abilities
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Modeling genetic algorithms with Markov chains.
• A measure concentration inequality for contracting Markov chains
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• Complexity theory and genetics: The computational power of crossing over

This page was built for publication: A genetic system based on simulated crossover of sequences of two-bit genes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q857396)