Category:Evolutionary algorithms: Difference between revisions

Revision as of 09:32, 13 March 2013

Latest revision as of 09:35, 29 December 2024

(12 intermediate revisions by 6 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}}

{{Commons cat}}

{{Cat main|Evolutionary algorithms}}

{{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:Bioinformatics algorithms]]

[[Category:Optimization algorithms and methods]]

[[Category:Evolutionary computation|Algorithms]]

[[Category:Artificial life models]]

[[Category:Artificial life models|Nature-inspired metaheuristics]]

[[Category:Algorithms]]