يعرض 1 - 20 نتائج من 9,261 نتيجة بحث عن '(( algorithm shows function ) OR ((( algorithm both function ) OR ( algorithm co function ))))', وقت الاستعلام: 0.46s تنقيح النتائج
  1. 1
  2. 2
  3. 3

    The pseudocode for the NAFPSO algorithm. حسب Huichao Guo (14515171)

    منشور في 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. …"
  4. 4

    PSO algorithm flowchart. حسب Huichao Guo (14515171)

    منشور في 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. …"
  5. 5
  6. 6
  7. 7

    Decision Graph to compute clusters according to Density Peak Clustering algorithm (Ref. [92]). حسب Rajdeep Kaur Grewal (12563150)

    منشور في 2022
    "…[<a href="http://www.ploscompbiol.org/article/info:doi/10.1371/journal.pcbi.1010114#pcbi.1010114.ref092" target="_blank">92</a>]. For both, Model 1 (A) and Model 2 (B), we observed only one such cluster center to exist implying the presence of a single minimum cost function in the parameter range explored by the PSO. …"
  8. 8

    Scheduling time of five algorithms. حسب Huichao Guo (14515171)

    منشور في 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. …"
  9. 9

    Convergence speed of five algorithms. حسب Huichao Guo (14515171)

    منشور في 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. …"
  10. 10
  11. 11

    Efficient Algorithms for GPU Accelerated Evaluation of the DFT Exchange-Correlation Functional حسب Ryan Stocks (16867476)

    منشور في 2025
    "…We show that batched formation of the XC matrix from the density matrix yields the best performance for large (>O(103) basis functions), sparse systems such as glycine chains and water clusters. …"
  12. 12
  13. 13
  14. 14
  15. 15

    Completion times for different algorithms. حسب Jianbin Zheng (587000)

    منشور في 2025
    "…This paper first analyzes the H-beam processing flow and appropriately simplifies it, develops a reinforcement learning environment for multi-agent scheduling, and applies the rMAPPO algorithm to make scheduling decisions. The effectiveness of the proposed method is then verified on both the physical work cell for riveting and welding and its digital twin platform, and it is compared with other baseline multi-agent reinforcement learning methods (MAPPO, MADDPG, and MASAC). …"
  16. 16

    The average cumulative reward of algorithms. حسب Jianbin Zheng (587000)

    منشور في 2025
    "…This paper first analyzes the H-beam processing flow and appropriately simplifies it, develops a reinforcement learning environment for multi-agent scheduling, and applies the rMAPPO algorithm to make scheduling decisions. The effectiveness of the proposed method is then verified on both the physical work cell for riveting and welding and its digital twin platform, and it is compared with other baseline multi-agent reinforcement learning methods (MAPPO, MADDPG, and MASAC). …"
  17. 17

    Simulation settings of rMAPPO algorithm. حسب Jianbin Zheng (587000)

    منشور في 2025
    "…This paper first analyzes the H-beam processing flow and appropriately simplifies it, develops a reinforcement learning environment for multi-agent scheduling, and applies the rMAPPO algorithm to make scheduling decisions. The effectiveness of the proposed method is then verified on both the physical work cell for riveting and welding and its digital twin platform, and it is compared with other baseline multi-agent reinforcement learning methods (MAPPO, MADDPG, and MASAC). …"
  18. 18

    Reward function related parameters. حسب Honglei Pang (22693724)

    منشور في 2025
    الموضوعات:
  19. 19

    Flexible CDOCKER: Hybrid Searching Algorithm and Scoring Function with Side Chain Conformational Entropy حسب Yujin Wu (2901128)

    منشور في 2021
    "…We also describe a novel hybrid searching algorithm that combines both molecular dynamics (MD)-based simulated annealing and genetic algorithm crossovers to address the enhanced sampling of the increased search space. …"
  20. 20

    Flexible CDOCKER: Hybrid Searching Algorithm and Scoring Function with Side Chain Conformational Entropy حسب Yujin Wu (2901128)

    منشور في 2021
    "…We also describe a novel hybrid searching algorithm that combines both molecular dynamics (MD)-based simulated annealing and genetic algorithm crossovers to address the enhanced sampling of the increased search space. …"