Evolutionary systems & genetic algorithms
From GenerativeArt
(Difference between revisions)
(→Early Genetic Art - William Latham (with Stephen Todd and others)) |
(→Genetic Variation Operations) |
||
For bit-string genetic representations genetic variations are fairly straightforward. | For bit-string genetic representations genetic variations are fairly straightforward. | ||
| - | {{SingleImage|imageWidthPlusTen= | + | {{SingleImage|imageWidthPlusTen=636|imageURL=http://www-viz.tamu.edu/courses/viza658/wiki/genetic/02.jpg|caption=Genetic Operations}} |
For engineering solutions with structured (non-bitstring) genes the distribution of mutations may be non-uniform, e.g. Gaussian (or Normal). Some studies have shown such techniques provide faster more accurate solutions. | For engineering solutions with structured (non-bitstring) genes the distribution of mutations may be non-uniform, e.g. Gaussian (or Normal). Some studies have shown such techniques provide faster more accurate solutions. | ||
