Content deleted Content added
BooBoo314159 (talk | contribs) No edit summary |
BooBoo314159 (talk | contribs) Submitting using AfC-submit-wizard |
||
Line 1:
{{Short description|Non-dominated sorting}}▼
{{Draft topics|computing}}▼
{{AfC topic|stem}}▼
{{AfC submission|||ts=20240129175012|u=BooBoo314159|ns=118}}
{{AFC submission|d|nn|u=BooBoo314159|ns=118|decliner=Vanderwaalforces|declinets=20231102133913|ts=20230714053833}} <!-- Do not remove this line! -->
Line 6 ⟶ 10:
----
▲{{Short description|Non-dominated sorting}}
{{Underlinked|date=November 2023}}
▲{{Draft topics|computing}}
▲{{AfC topic|stem}}
Non-dominated sorting (also known as non-dominated ranking) is a technique that involves categorizing a set of elements based on their dominance relationship with each other. The purpose of non-dominated sorting is to rank the elements from the best to the worst element according to their dominance relationship. The dominance relationship between elements is determined by comparing their scores on a fixed number of objective functions.<ref name="NSGA" />
| |||