Non-dominated Sorting
Non-Dominated Sorting is a hierarchical sorting algorithm used in multiobjective optimization that classifies a population of candidate solutions into successive layers of non-dominated fronts, where each front consists of solutions that are not dominated by any other solution within the same front, thereby distinguishing it from other sorting procedures by its reliance on Pareto dominance to establish solution ranking.
1.4K
Publications
46.2K
Citations
4.6K
Authors
1.4K
Institutions
Publications per year
2017–2026
929
Parents
1.4K
CARS: Continuous Evolution for Efficient Neural Architecture Search
Zhaohui Yang, Yunhe Wang, Xinghao Chen et al. · 2020 · 278 citations
1–5 of 1.4K
4.6K
13
h-index
13
h-index
8
h-index
8
h-index
Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology, India
8 publications · 189 citations
8
h-index
1–5 of 4.6K
1.4K

University of Tehran
Tehran, Iran
20 h-index
37 publications
1.1K citations

Centre National de la Recherche Scientifique
Paris, France
17 h-index
23 publications
941 citations

Iran University of Science and Technology
Tehran, Iran
17 h-index
28 publications
1.1K citations

Hohai University
Nanjing, China
15 h-index
21 publications
626 citations

Chinese Academy of Sciences
Beijing, China
14 h-index
22 publications
797 citations

Sharif University of Technology
Tehran, Iran
13 h-index
13 publications
820 citations

Hunan University
Changsha, China
13 h-index
14 publications
443 citations
Wuhan University of Technology
Wuhan, China
13 h-index
13 publications
432 citations
1–8 of 1.4K
51 publications · 1.7K citations
24
h-index
30 publications · 1.3K citations
22
h-index
35 publications · 919 citations
19
h-index
36 publications · 947 citations
18
h-index
23 publications · 529 citations
16
h-index
1–5