Search alternatives:
bayesian optimization » based optimization (Expand Search)
task optimization » based optimization (Expand Search), phase optimization (Expand Search), path optimization (Expand Search)
a bayesian » _ bayesian (Expand Search)
binary a » binary b (Expand Search), hilary a (Expand Search)
bayesian optimization » based optimization (Expand Search)
task optimization » based optimization (Expand Search), phase optimization (Expand Search), path optimization (Expand Search)
a bayesian » _ bayesian (Expand Search)
binary a » binary b (Expand Search), hilary a (Expand Search)
-
1
-
2
-
3
-
4
-
5
-
6
-
7
-
8
Optimized Bayesian regularization-back propagation neural network using data-driven intrusion detection system in Internet of Things
Published 2025“…Hence, Binary Black Widow Optimization Algorithm (BBWOA) is proposed in this manuscript to improve the BRBPNN classifier that detects intrusion precisely. …”
-
9
-
10
-
11
-
12
-
13
CDF of task latency, approximated as the inverse of the achieved computation rate.
Published 2025Subjects: -
14
-
15
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. …”
-
16
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. …”
-
17
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. …”
-
18
Comparisons of computation rate performance for different offloading algorithms.for N = 10, 20, 30.
Published 2025Subjects: -
19
Comparison of total time consumed for different offloading algorithms.for N = 10, 20, 30.
Published 2025Subjects: -
20