Search alternatives:
algorithm python » algorithm within (Expand Search), algorithms within (Expand Search), algorithm both (Expand Search)
algorithm which » algorithm within (Expand Search)
python function » protein function (Expand Search)
algorithm pre » algorithm pca (Expand Search), algorithm where (Expand Search), algorithm used (Expand Search)
algorithm python » algorithm within (Expand Search), algorithms within (Expand Search), algorithm both (Expand Search)
algorithm which » algorithm within (Expand Search)
python function » protein function (Expand Search)
algorithm pre » algorithm pca (Expand Search), algorithm where (Expand Search), algorithm used (Expand Search)
-
201
Optimization flow of the co-simulation method.
Published 2025“…This strategy combines the design of experiments (DOE), genetic algorithm (GA), and NLPQL algorithm, which is referred to as the DGN method. …”
-
202
The TL of the perforated membrane metamaterial.
Published 2025“…This strategy combines the design of experiments (DOE), genetic algorithm (GA), and NLPQL algorithm, which is referred to as the DGN method. …”
-
203
The process of the optimization (MIGA).
Published 2025“…This strategy combines the design of experiments (DOE), genetic algorithm (GA), and NLPQL algorithm, which is referred to as the DGN method. …”
-
204
The effect of each parameter on the peak value.
Published 2025“…This strategy combines the design of experiments (DOE), genetic algorithm (GA), and NLPQL algorithm, which is referred to as the DGN method. …”
-
205
-
206
Metapopulation model notation.
Published 2025“…We provide a theoretical explanation for this effectiveness by showing that the approximation factor (a measure of how well the algorithmic output for a problem instance compares to its theoretical optimum) of these algorithms depends on the <i>submodularity ratio</i> of the objective function <i>g</i>. …”
-
207
Estimates of for each problem instance.
Published 2025“…We provide a theoretical explanation for this effectiveness by showing that the approximation factor (a measure of how well the algorithmic output for a problem instance compares to its theoretical optimum) of these algorithms depends on the <i>submodularity ratio</i> of the objective function <i>g</i>. …”
-
208
Approximation factors for each problem instance.
Published 2025“…We provide a theoretical explanation for this effectiveness by showing that the approximation factor (a measure of how well the algorithmic output for a problem instance compares to its theoretical optimum) of these algorithms depends on the <i>submodularity ratio</i> of the objective function <i>g</i>. …”
-
209
-
210
The run time for each algorithm in seconds.
Published 2025“…In particular, we examine Autoregressive AR(1) vector autoregressive processes, which are commonly found in time-series applications. …”
-
211
-
212
Flowchart of simple ant colony algorithm.
Published 2025“…Based on a comprehensive assessment of service transmission reliability and time costs, a route satisfaction evaluation function model has been developed. Utilizing this model, an enhanced Risk-Time Ant Colony Optimization (RT-ACO) routing algorithm is proposed, which builds upon the traditional ant colony algorithm. …”
-
213
Greedy Man Optimization Algorithm (GMOA)
Published 2025“…GMOA draws inspiration from human behavior, specifically the metaphor of individuals who tenaciously hold on to their positions, modeled as resistant solutions influenced by metaphorical parasites (MMOs). The algorithm introduces two unique mechanisms: MMO resistance, which prevents premature replacement of solutions, ensuring stability and diversity, and periodic parasite removal, which promotes mutation and prevents stagnation. …”
-
214
-
215
Core genes were selected through PPI analysis based on three algorithms.
Published 2024“…<b>(B)</b> The priority of the top 10 genes was evaluated through MNC, which identifies clusters of protein nodes that are more functionally connected to each other and selects the central proteins within the cluster. …”
-
216
Using synthetic data to test group-searching algorithms in a context where the correct grouping of species is known and uniquely defined.
Published 2024“…(C) We use the synthetic data as input for three families of regression-based algorithms: the EQO of Ref. [<a href="http://www.ploscompbiol.org/article/info:doi/10.1371/journal.pcbi.1012590#pcbi.1012590.ref026" target="_blank">26</a>] (which groups species into two groups), and two families we call K-means and Metropolis (see text), which can return any specified number of groups. …”
-
217
Results of the comparative experiment.
Published 2025“…Furthermore, the Focal_EIOU loss function, which balances high- and low-quality anchors to increase detection and localization accuracy, replaces the CIOU loss function. …”
-
218
Comparison of attention mechanisms.
Published 2025“…Furthermore, the Focal_EIOU loss function, which balances high- and low-quality anchors to increase detection and localization accuracy, replaces the CIOU loss function. …”
-
219
Results of ablation experiments.
Published 2025“…Furthermore, the Focal_EIOU loss function, which balances high- and low-quality anchors to increase detection and localization accuracy, replaces the CIOU loss function. …”
-
220
Comparison of attention mechanisms.
Published 2025“…Furthermore, the Focal_EIOU loss function, which balances high- and low-quality anchors to increase detection and localization accuracy, replaces the CIOU loss function. …”