Category:Evolutionary algorithms: Difference between revisions

Revision as of 03:01, 5 August 2006

Latest revision as of 09:35, 29 December 2024

(29 intermediate revisions by 23 users not shown)

Line 1:

{{topic category}}

An '''evolutionary algorithm''' ('''EA''') is a [[heuristic]] [[optimization (computer science)|optimization]] [[algorithm]] using techniques inspired by mechanisms from [[organic evolution]] such as [[mutation]], [[recombination]], and [[natural selection]] to find an optimal configuration for a specific system within specific constraints.

{{cat diffuse}}

{{catmoreCommons cat}}

{{cat main}}

An '''evolutionary algorithm''' ('''EA''') is a [[heuristic]] [[Program optimization (computer science)|optimization]] [[algorithm]] using techniques inspired by mechanisms from [[Evolution|organic evolution]] such as [[mutation]], [[genetic recombination|recombination]], and [[natural selection]] to find an optimal configuration for a specific system within specific constraints.

[[Category:Machine learning]]

[[Category:OptimizationBioinformatics algorithms]]

[[Category:EvolutionaryOptimization computation|Algorithmsalgorithms and methods]]

[[Category:ArtificialEvolutionary lifecomputation]]

[[Category:Evolution|AlgorithmsArtificial life models]]

[[Category:AlgorithmsNature-inspired metaheuristics]]