Search alternatives:
algorithm python » algorithm within (Expand Search), algorithms within (Expand Search)
python function » protein function (Expand Search)
algorithm both » algorithm blood (Expand Search), algorithm b (Expand Search), algorithm etc (Expand Search)
algorithm body » algorithm model (Expand Search), algorithm blood (Expand Search), algorithm b (Expand Search)
both function » growth function (Expand Search), beach function (Expand Search), loss function (Expand Search)
body function » cost function (Expand Search)
algorithm python » algorithm within (Expand Search), algorithms within (Expand Search)
python function » protein function (Expand Search)
algorithm both » algorithm blood (Expand Search), algorithm b (Expand Search), algorithm etc (Expand Search)
algorithm body » algorithm model (Expand Search), algorithm blood (Expand Search), algorithm b (Expand Search)
both function » growth function (Expand Search), beach function (Expand Search), loss function (Expand Search)
body function » cost function (Expand Search)
-
21
-
22
Efficient Algorithms for GPU Accelerated Evaluation of the DFT Exchange-Correlation Functional
Published 2025“…Kohn–Sham density functional theory (KS-DFT) has become a cornerstone for studying the electronic structure of molecules and materials. …”
-
23
Comparison of the curves of the DCIOU loss function and the CIOU loss function.
Published 2025Subjects: -
24
-
25
The pseudocode for the NAFPSO algorithm.
Published 2025“…The experimental results show that compared with the traditional particle swarm optimization algorithm, NACFPSO performs well in both convergence speed and scheduling time, with an average convergence speed of 81.17 iterations and an average scheduling time of 200.00 minutes; while the average convergence speed of the particle swarm optimization algorithm is 82.17 iterations and an average scheduling time of 207.49 minutes. …”
-
26
PSO algorithm flowchart.
Published 2025“…The experimental results show that compared with the traditional particle swarm optimization algorithm, NACFPSO performs well in both convergence speed and scheduling time, with an average convergence speed of 81.17 iterations and an average scheduling time of 200.00 minutes; while the average convergence speed of the particle swarm optimization algorithm is 82.17 iterations and an average scheduling time of 207.49 minutes. …”
-
27
-
28
-
29
-
30
Comparison of different algorithms.
Published 2025“…A sophisticated optimization model has been developed to simulate the optimal operation of machinery, aiming to maximize equipment utilization efficiency while addressing the challenges posed by worker fatigue. An innovative algorithm, the improved hybrid gray wolf and whale algorithm fused with a penalty function for construction machinery optimization (IHWGWO), is introduced, incorporating a penalty function to handle constraints effectively. …”
-
31
-
32
-
33
-
34
-
35
-
36
-
37
Study proposed algorithm.
Published 2025“…The index of microvascular resistance (IMR) is a specific physiological parameter used to assess microvascular function. Invasive coronary assessment has been shown to be both feasible and safe. …”
-
38
Gillespie algorithm simulation parameters.
Published 2024“…Both the ensemble and stochastic models presented in this work have been verified using Monte Carlo molecular dynamic simulations that utilize the Gillespie algorithm. …”
-
39
Scheduling time of five algorithms.
Published 2025“…The experimental results show that compared with the traditional particle swarm optimization algorithm, NACFPSO performs well in both convergence speed and scheduling time, with an average convergence speed of 81.17 iterations and an average scheduling time of 200.00 minutes; while the average convergence speed of the particle swarm optimization algorithm is 82.17 iterations and an average scheduling time of 207.49 minutes. …”
-
40
Convergence speed of five algorithms.
Published 2025“…The experimental results show that compared with the traditional particle swarm optimization algorithm, NACFPSO performs well in both convergence speed and scheduling time, with an average convergence speed of 81.17 iterations and an average scheduling time of 200.00 minutes; while the average convergence speed of the particle swarm optimization algorithm is 82.17 iterations and an average scheduling time of 207.49 minutes. …”