Category:Genetic algorithms

From Biocrawler, the free encyclopedia.

A genetic algorithm (GA) is an algorithm used to find approximate solutions to difficult-to-solve problems through application of the principles of evolutionary biology to computer science. Genetic algorithms use biologically-derived techniques such as inheritance, mutation, natural selection, and recombination. Genetic algorithms are a particular class of evolutionary algorithms.

For more information, see the main article about Genetic algorithms.

Articles in category "Genetic algorithms"

There are 9 articles in this category.

C Chromosome (genetic algorithm) Crossover (genetic algorithm) F Fitness function

F cont. Fitness proportionate selection G Genetic algorithm Genetic operator I Inheritance (genetic algorithm)

M Mutation (genetic algorithm) W Weasel program

Wikipedia (http://en.wikipedia.org/wiki/Main_Page) Category:Genetic_algorithms (http://en.wikipedia.org/wiki/Category:Genetic_algorithms) version history (http://en.wikipedia.org/w/index.php?title=Category:Genetic_algorithms&action=history) GNU Free Documentation Lizenz (http://en.wikipedia.org/wiki/Wikipedia:Text_of_the_GNU_Free_Documentation_License) CC-by-sa (http://creativecommons.org/licenses/by-sa/2.5/)

---