Search alternatives:
test optimization » cost optimization (Expand Search), task optimization (Expand Search), yet optimization (Expand Search)
binary based » library based (Expand Search), linac based (Expand Search), binary mask (Expand Search)
binary data » primary data (Expand Search), dietary data (Expand Search)
data global » daily global (Expand Search)
based test » based testing (Expand Search)
test optimization » cost optimization (Expand Search), task optimization (Expand Search), yet optimization (Expand Search)
binary based » library based (Expand Search), linac based (Expand Search), binary mask (Expand Search)
binary data » primary data (Expand Search), dietary data (Expand Search)
data global » daily global (Expand Search)
based test » based testing (Expand Search)
-
1
-
2
-
3
-
4
-
5
-
6
-
7
-
8
-
9
Friedman average rank sum test results.
Published 2025“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”
-
10
-
11
-
12
-
13
-
14
The Pseudo-Code of the IRBMO Algorithm.
Published 2025“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”
-
15
-
16
-
17
IRBMO vs. meta-heuristic algorithms boxplot.
Published 2025“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”
-
18
IRBMO vs. feature selection algorithm boxplot.
Published 2025“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”
-
19
-
20