Search alternatives:
process optimization » robust optimization (Expand Search), model optimization (Expand Search), policy optimization (Expand Search)
library based » laboratory based (Expand Search)
binary based » binary mask (Expand Search), linac based (Expand Search)
process optimization » robust optimization (Expand Search), model optimization (Expand Search), policy optimization (Expand Search)
library based » laboratory based (Expand Search)
binary based » binary mask (Expand Search), linac based (Expand Search)
-
1
Python-Based Algorithm for Estimating NRTL Model Parameters with UNIFAC Model Simulation Results
Published 2025Subjects: -
2
-
3
An optimal solution for the HFS instance.
Published 2025“…In recent years, due to the advantages of nonlinear access and fully parallel processing, the probe machine has shown powerful computing capabilities and promising applications in solving various combinatorial optimization problems. …”
-
4
-
5
Proposed Algorithm.
Published 2025“…To enhance the offloading decision-making process, the algorithm incorporates the Newton-Raphson method for fast and efficient optimization of the computation rate under energy constraints. …”
-
6
Comparisons between ADAM and NADAM optimizers.
Published 2025“…To enhance the offloading decision-making process, the algorithm incorporates the Newton-Raphson method for fast and efficient optimization of the computation rate under energy constraints. …”
-
7
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. …”
-
8
Comparison based on hard instances from [79].
Published 2025“…In recent years, due to the advantages of nonlinear access and fully parallel processing, the probe machine has shown powerful computing capabilities and promising applications in solving various combinatorial optimization problems. …”
-
9
-
10
-
11
-
12
-
13
-
14
-
15
-
16
-
17
-
18
-
19
-
20