Category:Genetic algorithms
 | Computing portal |
Here is a list of articles in the Genetic algorithms category of the Computing portal that unifies foundations of mathematics and computations using computers. 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.
Pages in category "Genetic algorithms"
The following 43 pages are in this category, out of 43 total.
- Genetic algorithm (computing)
A
- List of genetic algorithm applications (computing)
C
- Chromosome (genetic algorithm) (computing)
- Clonal selection algorithm (computing)
- Crossover (genetic algorithm) (computing)
- Cultural algorithm (computing)
D
- Defining length (computing)
E
- Edge recombination operator (computing)
- Evolver (software)
F
- Fitness approximation (computing)
- Fitness function (computing)
- Fitness proportionate selection (computing)
- Fly algorithm (computing)
G
- GATTO (engineering)
- Gene expression programming (computing)
- Genetic algorithm scheduling (computing)
- Genetic algorithms in economics (computing)
- Genetic fuzzy systems (computing)
- Genetic memory (computer science) (computing)
- Genetic operator (computing)
- Genetic programming (computing)
H
- Holland's schema theorem (computing)
- HyperNEAT (computing)
I
- Inheritance (genetic algorithm) (computing)
L
- Linkage disequilibrium score regression (computing)
M
- Mating pool (computing)
- Multi expression programming (computing)
- Mutation (genetic algorithm) (computing)
N
- Neuroevolution of augmenting topologies (computing)
P
- Parallel metaheuristic (computing)
- Population-based incremental learning (computing)
- Premature convergence (biology)
- Promoter based genetic algorithm (computing)
Q
- Quality control and genetic algorithms (computing)
R
- Reward-based selection (computing)
S
- Santa Fe Trail problem (computing)
- Schema (genetic algorithms) (computing)
- Search-based software engineering (computing)
- Selection (genetic algorithm) (computing)
- Stochastic universal sampling (computing)
T
- Tournament selection (computing)
- Truncation selection (computing)
W
- Weasel program (computing)
Mathematics
Organizations
Books
About