Search alternatives:
resource optimization » resource utilization (Expand Search), resource utilisation (Expand Search), resource limitations (Expand Search)
robust optimization » process optimization (Expand Search), robust estimation (Expand Search), joint optimization (Expand Search)
also resource » actor resource (Expand Search), value resource (Expand Search), low resource (Expand Search)
binary data » primary data (Expand Search), dietary data (Expand Search)
resource optimization » resource utilization (Expand Search), resource utilisation (Expand Search), resource limitations (Expand Search)
robust optimization » process optimization (Expand Search), robust estimation (Expand Search), joint optimization (Expand Search)
also resource » actor resource (Expand Search), value resource (Expand Search), low resource (Expand Search)
binary data » primary data (Expand Search), dietary data (Expand Search)
-
1
-
2
-
3
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. …”
-
4
Dynamic resource allocation process.
Published 2025“…Subsequently, we implement an optimal binary tree decision-making algorithm, grounded in dynamic programming, to achieve precise allocation of elastic resources within data streams, significantly bolstering resource utilization. …”
-
5
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. …”
-
6
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. …”
-
7
Secure MANET routing with blockchain-enhanced latent encoder coupled GANs and BEPO optimization
Published 2025“…The performance of the proposed LEGAN-BEPO-BCMANET technique attains 29.786%, 19.25%, 22.93%, 27.21%, 31.02%, 26.91%, and 25.61% greater throughput, compared to existing methods like Blockchain-based BATMAN protocol utilizing MANET with an ensemble algorithm (BATMAN-MANET), Block chain-based trusted distributed routing scheme with optimized dropout ensemble extreme learning neural network in MANET (DEELNN-MANET), A secured trusted routing utilizing structure of a new directed acyclic graph-blockchain in MANET internet of things environment (DAG-MANET), An Optimized Link State Routing Protocol with Blockchain Framework for Efficient Video-Packet Transmission and Security over MANET (OLSRP-MANET), Auto-metric Graph Neural Network based Blockchain Technology for Protected Dynamic Optimum Routing in MANET (AGNN-MANET) and Data security-based routing in MANETs under key management process (DSR-MANET) respectively.…”
-
8
Supplementary file 1_Encodings of the weighted MAX k-CUT problem on qubit systems.pdf
Published 2025“…This study explores encoding methods for MAX k-CUT on qubit systems by utilizing quantum approximate optimization algorithms (QAOA) and addressing the challenge of encoding integer values on quantum devices with binary variables. …”
-
9
-
10
Predicting Thermal Decomposition Temperature of Binary Imidazolium Ionic Liquid Mixtures from Molecular Structures
Published 2021“…The subset of optimal descriptors was screened by combining the genetic algorithm with the multiple linear regression method. …”
-
11
Confusion matrix.
Published 2025“…Subsequently, we implement an optimal binary tree decision-making algorithm, grounded in dynamic programming, to achieve precise allocation of elastic resources within data streams, significantly bolstering resource utilization. …”
-
12
Parameter settings.
Published 2025“…Subsequently, we implement an optimal binary tree decision-making algorithm, grounded in dynamic programming, to achieve precise allocation of elastic resources within data streams, significantly bolstering resource utilization. …”
-
13
Event-driven data flow processing.
Published 2025“…Subsequently, we implement an optimal binary tree decision-making algorithm, grounded in dynamic programming, to achieve precise allocation of elastic resources within data streams, significantly bolstering resource utilization. …”
-
14
IRBMO vs. variant comparison adaptation data.
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
Multicategory Angle-Based Learning for Estimating Optimal Dynamic Treatment Regimes With Censored Data
Published 2021“…Specifically, the proposed method obtains the optimal DTR via integrating estimations of decision rules at multiple stages into a single multicategory classification algorithm without imposing additional constraints, which is also more computationally efficient and robust. …”
-
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. …”