Showing 201 - 220 results of 1,851 for search '(( ((algorithm pre) OR (algorithm which)) function ) OR ( algorithm python function ))*', query time: 0.27s Refine Results
  1. 201

    Optimization flow of the co-simulation method. by Shangyang Jin (21772466)

    Published 2025
    “…This strategy combines the design of experiments (DOE), genetic algorithm (GA), and NLPQL algorithm, which is referred to as the DGN method. …”
  2. 202

    The TL of the perforated membrane metamaterial. by Shangyang Jin (21772466)

    Published 2025
    “…This strategy combines the design of experiments (DOE), genetic algorithm (GA), and NLPQL algorithm, which is referred to as the DGN method. …”
  3. 203

    The process of the optimization (MIGA). by Shangyang Jin (21772466)

    Published 2025
    “…This strategy combines the design of experiments (DOE), genetic algorithm (GA), and NLPQL algorithm, which is referred to as the DGN method. …”
  4. 204

    The effect of each parameter on the peak value. by Shangyang Jin (21772466)

    Published 2025
    “…This strategy combines the design of experiments (DOE), genetic algorithm (GA), and NLPQL algorithm, which is referred to as the DGN method. …”
  5. 205
  6. 206

    Metapopulation model notation. by Jeffrey Keithley (14626551)

    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>. …”
  7. 207

    Estimates of for each problem instance. by Jeffrey Keithley (14626551)

    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>. …”
  8. 208

    Approximation factors for each problem instance. by Jeffrey Keithley (14626551)

    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>. …”
  9. 209
  10. 210

    The run time for each algorithm in seconds. by Edward Antonian (21453161)

    Published 2025
    “…In particular, we examine Autoregressive AR(1) vector autoregressive processes, which are commonly found in time-series applications. …”
  11. 211
  12. 212

    Flowchart of simple ant colony algorithm. by Yang Yu (4292)

    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. …”
  13. 213

    Greedy Man Optimization Algorithm (GMOA) by Hamed Nozari (20601020)

    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. …”
  14. 214
  15. 215

    Core genes were selected through PPI analysis based on three algorithms. by Dong-Hee Han (140305)

    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. …”
  16. 216

    Using synthetic data to test group-searching algorithms in a context where the correct grouping of species is known and uniquely defined. by Yuanchen Zhao (12905580)

    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. …”
  17. 217

    Results of the comparative experiment. by Jia Li (160557)

    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. …”
  18. 218

    Comparison of attention mechanisms. by Jia Li (160557)

    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. …”
  19. 219

    Results of ablation experiments. by Jia Li (160557)

    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. …”
  20. 220

    Comparison of attention mechanisms. by Jia Li (160557)

    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. …”