Search alternatives:
process optimization » model optimization (Expand Search)
design optimization » bayesian optimization (Expand Search)
phase process » phase proteins (Expand Search), whole process (Expand Search), phase protein (Expand Search)
binary phase » binary image (Expand Search), final phase (Expand Search)
binary data » primary data (Expand Search), dietary data (Expand Search)
process optimization » model optimization (Expand Search)
design optimization » bayesian optimization (Expand Search)
phase process » phase proteins (Expand Search), whole process (Expand Search), phase protein (Expand Search)
binary phase » binary image (Expand Search), final phase (Expand Search)
binary data » primary data (Expand Search), dietary data (Expand Search)
-
41
-
42
Proposed Algorithm.
Published 2025“…Hence, an Energy-Harvesting Reinforcement Learning-based Offloading Decision Algorithm (EHRL) is proposed. EHRL integrates Reinforcement Learning (RL) with Deep Neural Networks (DNNs) to dynamically optimize binary offloading decisions, which in turn obviates the requirement for manually labeled training data and thus avoids the need for solving complex optimization problems repeatedly. …”
-
43
Parameter settings of the comparison algorithms.
Published 2024“…In this paper, we present an improved mountain gazelle optimizer (IMGO) based on the newly proposed mountain gazelle optimizer (MGO) and design a binary version of IMGO (BIMGO) to solve the feature selection problem for medical data. …”
-
44
-
45
Comparisons between ADAM and NADAM optimizers.
Published 2025“…Hence, an Energy-Harvesting Reinforcement Learning-based Offloading Decision Algorithm (EHRL) is proposed. EHRL integrates Reinforcement Learning (RL) with Deep Neural Networks (DNNs) to dynamically optimize binary offloading decisions, which in turn obviates the requirement for manually labeled training data and thus avoids the need for solving complex optimization problems repeatedly. …”
-
46
Wilcoxon test results for feature selection.
Published 2025“…The proposed approach integrates binary feature selection and metaheuristic optimization into a unified optimization process, effectively balancing exploration and exploitation to handle complex, high-dimensional datasets. …”
-
47
Feature selection metrics and their definitions.
Published 2025“…The proposed approach integrates binary feature selection and metaheuristic optimization into a unified optimization process, effectively balancing exploration and exploitation to handle complex, high-dimensional datasets. …”
-
48
Statistical summary of all models.
Published 2025“…The proposed approach integrates binary feature selection and metaheuristic optimization into a unified optimization process, effectively balancing exploration and exploitation to handle complex, high-dimensional datasets. …”
-
49
Feature selection results.
Published 2025“…The proposed approach integrates binary feature selection and metaheuristic optimization into a unified optimization process, effectively balancing exploration and exploitation to handle complex, high-dimensional datasets. …”
-
50
ANOVA test for feature selection.
Published 2025“…The proposed approach integrates binary feature selection and metaheuristic optimization into a unified optimization process, effectively balancing exploration and exploitation to handle complex, high-dimensional datasets. …”
-
51
Classification performance of ML and DL models.
Published 2025“…The proposed approach integrates binary feature selection and metaheuristic optimization into a unified optimization process, effectively balancing exploration and exploitation to handle complex, high-dimensional datasets. …”
-
52
IRBMO vs. variant comparison adaptation data.
Published 2025“…In order to comprehensively verify the performance of IRBMO, this paper designs a series of experiments to compare it with nine mainstream binary optimization algorithms. …”
-
53
Bayesian sequential design for sensitivity experiments with hybrid responses
Published 2023“…To deal with the problem of complex computation involved in searching for optimal designs, fast algorithms are presented using two strategies to approximate the optimal criterion, denoted as SI-optimal design and Bayesian D-optimal design, respectively. …”
-
54
Pseudo Code of RBMO.
Published 2025“…In order to comprehensively verify the performance of IRBMO, this paper designs a series of experiments to compare it with nine mainstream binary optimization algorithms. …”
-
55
P-value on CEC-2017(Dim = 30).
Published 2025“…In order to comprehensively verify the performance of IRBMO, this paper designs a series of experiments to compare it with nine mainstream binary optimization algorithms. …”
-
56
Memory storage behavior.
Published 2025“…In order to comprehensively verify the performance of IRBMO, this paper designs a series of experiments to compare it with nine mainstream binary optimization algorithms. …”
-
57
Elite search behavior.
Published 2025“…In order to comprehensively verify the performance of IRBMO, this paper designs a series of experiments to compare it with nine mainstream binary optimization algorithms. …”
-
58
Description of the datasets.
Published 2025“…In order to comprehensively verify the performance of IRBMO, this paper designs a series of experiments to compare it with nine mainstream binary optimization algorithms. …”
-
59
S and V shaped transfer functions.
Published 2025“…In order to comprehensively verify the performance of IRBMO, this paper designs a series of experiments to compare it with nine mainstream binary optimization algorithms. …”
-
60
S- and V-Type transfer function diagrams.
Published 2025“…In order to comprehensively verify the performance of IRBMO, this paper designs a series of experiments to compare it with nine mainstream binary optimization algorithms. …”