Category:Evolutionary algorithms: Difference between revisions

Revision as of 20:59, 19 September 2008

Latest revision as of 09:35, 29 December 2024

(19 intermediate revisions by 13 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]], [[genetic recombination|recombination]], and [[natural selection]] to find an optimal configuration for a specific system within specific constraints.

{{cat diffuse}}

{{catmoreCommons cat}}

{{Commons cat|Evolutionary algorithmsmain}}

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:AlgorithmsArtificial life models]]

[[Category:Nature-inspired metaheuristics]]

[[fa:رده:الگوریتم‌های تکاملی]]

[[pt:Categoria:Algoritmos evolutivos]]

[[vi:Thể loại:Giải thuật tiến hóa]]

[[tr:Kategori:Evrimsel algoritmalar]]

[[zh:Category:进化算法]]