When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Genetic algorithm - Wikipedia

    en.wikipedia.org/wiki/Genetic_algorithm

    Genetic algorithms with adaptive parameters (adaptive genetic algorithms, AGAs) is another significant and promising variant of genetic algorithms. The probabilities of crossover (pc) and mutation (pm) greatly determine the degree of solution accuracy and the convergence speed that genetic algorithms can obtain.

  3. List of genetic algorithm applications - Wikipedia

    en.wikipedia.org/wiki/List_of_genetic_algorithm...

    Learning robot behavior using genetic algorithms; Image processing: Dense pixel matching [16] Learning fuzzy rule base using genetic algorithms; Molecular structure optimization (chemistry) Optimisation of data compression systems, for example using wavelets. Power electronics design. [17] Traveling salesman problem and its applications [14]

  4. Population model (evolutionary algorithm) - Wikipedia

    en.wikipedia.org/wiki/Population_model...

    The population model of an evolutionary algorithm (EA) describes the structural properties of its population to which its members are subject. A population is the set of all proposed solutions of an EA considered in one iteration, which are also called individuals according to the biological role model.

  5. Genetic programming - Wikipedia

    en.wikipedia.org/wiki/Genetic_programming

    Genetic programming (GP) is an evolutionary algorithm, an artificial intelligence technique mimicking natural evolution, which operates on a population of programs. It applies the genetic operators selection according to a predefined fitness measure , mutation and crossover .

  6. Mutation (evolutionary algorithm) - Wikipedia

    en.wikipedia.org/wiki/Mutation_(evolutionary...

    The classic example of a mutation operator of a binary coded genetic algorithm (GA) involves a probability that an arbitrary bit in a genetic sequence will be flipped from its original state. A common method of implementing the mutation operator involves generating a random variable for each bit in a sequence. This random variable tells whether ...

  7. Gene expression programming - Wikipedia

    en.wikipedia.org/wiki/Gene_expression_programming

    The genetic operators used in the GEP-RNC system are an extension to the genetic operators of the basic GEP algorithm (see above), and they all can be straightforwardly implemented in these new chromosomes. On the other hand, the basic operators of mutation, inversion, transposition, and recombination are also used in the GEP-RNC algorithm.

  8. Crossover (evolutionary algorithm) - Wikipedia

    en.wikipedia.org/wiki/Crossover_(evolutionary...

    Crossover in evolutionary algorithms and evolutionary computation, also called recombination, is a genetic operator used to combine the genetic information of two parents to generate new offspring. It is one way to stochastically generate new solutions from an existing population, and is analogous to the crossover that happens during sexual ...

  9. Neuroevolution of augmenting topologies - Wikipedia

    en.wikipedia.org/wiki/Neuroevolution_of...

    The competing conventions problem arises when there is more than one way of representing information in a phenotype. For example, if a genome contains neurons A, B and C and is represented by [A B C], if this genome is crossed with an identical genome (in terms of functionality) but ordered [C B A] crossover will yield children that are missing information ([A B A] or [C B C]), in fact 1/3 of ...