Showing 681 - 700 results of 4,770 for search '(( algorithm cohesin function ) OR ((( algorithm python function ) OR ( algorithm a function ))))', query time: 0.49s Refine Results
  1. 681

    The structure of a pressure vessel. by Yanzhao Gu (21192659)

    Published 2025
    “…The experimental results showed that GWOA achieved better convergence speed and solution accuracy than other algorithms in most test functions, especially in multimodal and compositional optimization problems, with an Overall Efficiency (OE) value of 74.46%. …”
  2. 682

    The structure of a speed reducer. by Yanzhao Gu (21192659)

    Published 2025
    “…The experimental results showed that GWOA achieved better convergence speed and solution accuracy than other algorithms in most test functions, especially in multimodal and compositional optimization problems, with an Overall Efficiency (OE) value of 74.46%. …”
  3. 683

    The structure of a piston lever. by Yanzhao Gu (21192659)

    Published 2025
    “…The experimental results showed that GWOA achieved better convergence speed and solution accuracy than other algorithms in most test functions, especially in multimodal and compositional optimization problems, with an Overall Efficiency (OE) value of 74.46%. …”
  4. 684
  5. 685

    Data Sheet 1_IGSA-SAC: a novel approach for intrusion detection using improved gravitational search algorithm and soft actor-critic.docx by Lizhong Jin (20991293)

    Published 2025
    “…This is achieved through fitness normalization with an Adaptive Search Radius and a sigmoid function to modulate the gravitational constant. …”
  6. 686

    The parameters of simulation scenarios. by Le Huu Binh (18340233)

    Published 2025
    “…However, solving the RNP problem in WMN is difficult because it is NP-hard. As a result, this problem can only be solved using approximate optimization algorithms such as heuristics and meta-heuristics. …”
  7. 687

    S1 Dataset - by Le Huu Binh (18340233)

    Published 2025
    “…However, solving the RNP problem in WMN is difficult because it is NP-hard. As a result, this problem can only be solved using approximate optimization algorithms such as heuristics and meta-heuristics. …”
  8. 688
  9. 689
  10. 690
  11. 691

    Bootstrap results (N = 368). by Linsha Liu (20378293)

    Published 2024
    “…Since the inherent flaws of virtual social networking cannot be eliminated solely through algorithm matching, a potential solution is to introduce more offline to online social functions for strangers. …”
  12. 692

    Analysis of confirmatory factors (N = 368). by Linsha Liu (20378293)

    Published 2024
    “…Since the inherent flaws of virtual social networking cannot be eliminated solely through algorithm matching, a potential solution is to introduce more offline to online social functions for strangers. …”
  13. 693

    The relevant data file for this article. by Linsha Liu (20378293)

    Published 2024
    “…Since the inherent flaws of virtual social networking cannot be eliminated solely through algorithm matching, a potential solution is to introduce more offline to online social functions for strangers. …”
  14. 694

    Results of common fit indexes for SEM (N = 368). by Linsha Liu (20378293)

    Published 2024
    “…Since the inherent flaws of virtual social networking cannot be eliminated solely through algorithm matching, a potential solution is to introduce more offline to online social functions for strangers. …”
  15. 695

    Final path. by Zhenggang Wang (1753657)

    Published 2025
    “…<div><p>In response to the widely used RRT-Connect path planning algorithm in the field of robotic arms, which has problems such as long search time, random node growth, multiple and unsmooth path turns, a path planning algorithm combining dynamic step size and artificial potential field is proposed. …”
  16. 696

    Expansion procedure. by Zhenggang Wang (1753657)

    Published 2025
    “…<div><p>In response to the widely used RRT-Connect path planning algorithm in the field of robotic arms, which has problems such as long search time, random node growth, multiple and unsmooth path turns, a path planning algorithm combining dynamic step size and artificial potential field is proposed. …”
  17. 697

    Artificial potential field method. by Zhenggang Wang (1753657)

    Published 2025
    “…<div><p>In response to the widely used RRT-Connect path planning algorithm in the field of robotic arms, which has problems such as long search time, random node growth, multiple and unsmooth path turns, a path planning algorithm combining dynamic step size and artificial potential field is proposed. …”
  18. 698

    Modified D-H parameters. by Zhenggang Wang (1753657)

    Published 2025
    “…<div><p>In response to the widely used RRT-Connect path planning algorithm in the field of robotic arms, which has problems such as long search time, random node growth, multiple and unsmooth path turns, a path planning algorithm combining dynamic step size and artificial potential field is proposed. …”
  19. 699

    Path comparison before and after smoothing. by Zhenggang Wang (1753657)

    Published 2025
    “…<div><p>In response to the widely used RRT-Connect path planning algorithm in the field of robotic arms, which has problems such as long search time, random node growth, multiple and unsmooth path turns, a path planning algorithm combining dynamic step size and artificial potential field is proposed. …”
  20. 700

    Schematic diagram of dynamic step size expansion. by Zhenggang Wang (1753657)

    Published 2025
    “…<div><p>In response to the widely used RRT-Connect path planning algorithm in the field of robotic arms, which has problems such as long search time, random node growth, multiple and unsmooth path turns, a path planning algorithm combining dynamic step size and artificial potential field is proposed. …”