بدائل البحث:
algorithm python » algorithm within (توسيع البحث), algorithms within (توسيع البحث), algorithm both (توسيع البحث)
algorithm from » algorithm flow (توسيع البحث)
from function » from functional (توسيع البحث), fc function (توسيع البحث)
algorithm a » algorithms a (توسيع البحث), algorithm _ (توسيع البحث), algorithm b (توسيع البحث)
algorithm python » algorithm within (توسيع البحث), algorithms within (توسيع البحث), algorithm both (توسيع البحث)
algorithm from » algorithm flow (توسيع البحث)
from function » from functional (توسيع البحث), fc function (توسيع البحث)
algorithm a » algorithms a (توسيع البحث), algorithm _ (توسيع البحث), algorithm b (توسيع البحث)
-
41
Architecture of AGAN algorithm model.
منشور في 2024"…However, these statistical methods require collecting data from the entire research area, which consumes a significant amount of manpower and material resources. …"
-
42
ROC curves of six algorithms.
منشور في 2024"…However, these statistical methods require collecting data from the entire research area, which consumes a significant amount of manpower and material resources. …"
-
43
-
44
-
45
CEC2017 test function test results.
منشور في 2025"…<div><p>To address the limitations of the Zebra Optimization Algorithm (ZOA), including insufficient late-stage optimization search capability, susceptibility to local optima, slow convergence, and inadequate exploration, this paper proposes an enhanced Zebra Optimization Algorithm integrating opposition-based learning and a dynamic elite-pooling strategy (OP-ZOA: Opposition-Based Learning Dynamic Elite-Pooling Zebra Optimization Algorithm). he proposed search algorithm employs a good point set-elite opposition-based learning mechanism to initialize the population, enhancing diversity and facilitating escape from local optima. …"
-
46
High-dimensional benchmark test functions.
منشور في 2025"…Finally, the Cauchy-Gaussian mutation strategy is utilized to prevent the algorithm from falling into local traps. These three steps enable LLSKSO to achieve a dynamic balance between local and global search. …"
-
47
Pseudo-code of MWOA algorithm.
منشور في 2024"…In essence, it prevents algorithms from settling for suboptimal solutions too soon, encouraging exploration of a broader solution space before converging, by incorporating cauchy variation and a perturbation term, MWOA achieve optimization over a wide search space. …"
-
48
Biological Function Assignment across Taxonomic Levels in Mass-Spectrometry-Based Metaproteomics via a Modified Expectation Maximization Algorithm
منشور في 2025"…To overcome this limitation, we implemented an expectation-maximization (EM) algorithm, along with a biological function database, within the MiCId workflow. …"
-
49
F1-scores of anomaly detection algorithms.
منشور في 2025"…This strategy is integrated into a random forest algorithm by replacing the conventional voting method. …"
-
50
Images of partial benchmark functions.
منشور في 2025"…In order to effectively handle extensive datasets, researchers have introduced diverse classification algorithms. Notably, Kernel Extreme Learning Machine (KELM), as a fast and effective classification method, has received widespread attention. …"
-
51
Description of unimodal benchmark functions.
منشور في 2024"…In essence, it prevents algorithms from settling for suboptimal solutions too soon, encouraging exploration of a broader solution space before converging, by incorporating cauchy variation and a perturbation term, MWOA achieve optimization over a wide search space. …"
-
52
Description of multimodal benchmark functions.
منشور في 2024"…In essence, it prevents algorithms from settling for suboptimal solutions too soon, encouraging exploration of a broader solution space before converging, by incorporating cauchy variation and a perturbation term, MWOA achieve optimization over a wide search space. …"
-
53
-
54
-
55
-
56
Parameter settings for metaheuristic algorithms.
منشور في 2025"…The performance of the canonical WOA is improved through innovative strategies: first, an initialization process using Good Nodes Set is introduced to ensure that the search starts from a higher-quality baseline; second, a distance-based guided search strategy is employed to adjust the search direction and intensity by calculating the distance to the optimal solution, which enhances the algorithm’s ability to escape local optima; and lastly, LSWOA introduces an enhanced spiral updating strategy, while the enhanced spiral-enveloping prey strategy effectively balances exploration and exploitation by dynamically adjusting the spiral shape parameters to adapt to different stages of the search, thereby more accurately updating the positions of individuals and improving convergence speed. …"
-
57
PFC value of algorithms on two datasets.
منشور في 2024"…However, these statistical methods require collecting data from the entire research area, which consumes a significant amount of manpower and material resources. …"
-
58
If datasets are small and/or noisy, linear-regression-based algorithms for identifying functional groups outperform more complex versions.
منشور في 2024"…Both versions are evaluated on the same synthetic datasets with a 3-group ground truth. Each algorithm return a set of coarsened <i>variables</i> (a grouping of species into three groups) and a <i>model</i> that uses these variables to predict the function. …"
-
59
-
60
Standard benchmark functions [42].
منشور في 2025"…The performance of the canonical WOA is improved through innovative strategies: first, an initialization process using Good Nodes Set is introduced to ensure that the search starts from a higher-quality baseline; second, a distance-based guided search strategy is employed to adjust the search direction and intensity by calculating the distance to the optimal solution, which enhances the algorithm’s ability to escape local optima; and lastly, LSWOA introduces an enhanced spiral updating strategy, while the enhanced spiral-enveloping prey strategy effectively balances exploration and exploitation by dynamically adjusting the spiral shape parameters to adapt to different stages of the search, thereby more accurately updating the positions of individuals and improving convergence speed. …"