بدائل البحث:
algorithm harding » algorithm using (توسيع البحث), algorithm machine (توسيع البحث), algorithm showing (توسيع البحث)
algorithm python » algorithm within (توسيع البحث), algorithms within (توسيع البحث)
harding function » hardening function (توسيع البحث), hearing functions (توسيع البحث), varying functions (توسيع البحث)
algorithm both » algorithm blood (توسيع البحث), algorithm b (توسيع البحث), algorithm etc (توسيع البحث)
algorithm harding » algorithm using (توسيع البحث), algorithm machine (توسيع البحث), algorithm showing (توسيع البحث)
algorithm python » algorithm within (توسيع البحث), algorithms within (توسيع البحث)
harding function » hardening function (توسيع البحث), hearing functions (توسيع البحث), varying functions (توسيع البحث)
algorithm both » algorithm blood (توسيع البحث), algorithm b (توسيع البحث), algorithm etc (توسيع البحث)
-
81
-
82
-
83
-
84
-
85
-
86
-
87
-
88
-
89
Efficient Algorithms for GPU Accelerated Evaluation of the DFT Exchange-Correlation Functional
منشور في 2025"…Kohn–Sham density functional theory (KS-DFT) has become a cornerstone for studying the electronic structure of molecules and materials. …"
-
90
-
91
-
92
-
93
The pseudocode for the NAFPSO algorithm.
منشور في 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. …"
-
94
PSO algorithm flowchart.
منشور في 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. …"
-
95
Parselmouth for bioacoustics: automated acoustic analysis in Python
منشور في 2023"…Five years ago, the Python package Parselmouth was released to provide easy and intuitive access to all functionality in the Praat software. …"
-
96
Prediction performance of different optimization algorithms.
منشور في 2021"…<p>(A) 3 algorithms were compared in terms of the residuals of the cost function of the optimized TF on 7 mice datasets (Derivative free algorithm failed in optimizing a TF in a mouse). …"
-
97
-
98
Comparison of different algorithms.
منشور في 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. …"
-
99
Overnight technician routing and scheduling problem with time windows and balanced workloads: a bi-objective zebra optimization algorithm
منشور في 2025"…</p> <p><b>Highlights</b></p><p>An ML-based bi-objective zebra optimisation algorithm to treat large-scale TRSPs</p><p>Centroid-based clustering on the population of zebras to avoid bias towards a specific search space</p><p>Making a trade-off between exploration and exploitation of the feasible region in the developed algorithm</p><p>A new MINLP model of a weighted bi-objective TRSP with limited capacity depots</p><p>Workload function, penalty function for lateness, subcontracts, time windows for tasks and breaks</p><p>Experiments using real data to show the performance of the model and solution method</p><p></p> <p>An ML-based bi-objective zebra optimisation algorithm to treat large-scale TRSPs</p> <p>Centroid-based clustering on the population of zebras to avoid bias towards a specific search space</p> <p>Making a trade-off between exploration and exploitation of the feasible region in the developed algorithm</p> <p>A new MINLP model of a weighted bi-objective TRSP with limited capacity depots</p> <p>Workload function, penalty function for lateness, subcontracts, time windows for tasks and breaks</p> <p>Experiments using real data to show the performance of the model and solution method</p>…"
-
100