Search alternatives:
feature optimization » resource optimization (Expand Search), feature elimination (Expand Search), structure optimization (Expand Search)
policy optimization » topology optimization (Expand Search), wolf optimization (Expand Search), process optimization (Expand Search)
task feature » based feature (Expand Search), each feature (Expand Search), a feature (Expand Search)
binary task » binary mask (Expand Search)
task policy » risk policy (Expand Search)
feature optimization » resource optimization (Expand Search), feature elimination (Expand Search), structure optimization (Expand Search)
policy optimization » topology optimization (Expand Search), wolf optimization (Expand Search), process optimization (Expand Search)
task feature » based feature (Expand Search), each feature (Expand Search), a feature (Expand Search)
binary task » binary mask (Expand Search)
task policy » risk policy (Expand Search)
-
1
-
2
-
3
-
4
-
5
-
6
-
7
-
8
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. …”
-
9
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. …”
-
10
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. …”
-
11
-
12
CDF of task latency, approximated as the inverse of the achieved computation rate.
Published 2025Subjects: -
13
-
14
-
15
Comparisons of computation rate performance for different offloading algorithms.for N = 10, 20, 30.
Published 2025Subjects: -
16
Comparison of total time consumed for different offloading algorithms.for N = 10, 20, 30.
Published 2025Subjects: -
17
Pseudo Code of RBMO.
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
P-value on CEC-2017(Dim = 30).
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
Memory storage behavior.
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. …”
-
20
Elite search behavior.
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. …”