Showing 1 - 20 results of 8,636 for search '(( element method algorithm ) OR ((( data routing algorithm ) OR ( based method algorithm ))))', query time: 0.45s Refine Results
  1. 1

    Routing policy based on path satisfaction. by Yang Yu (4292)

    Published 2025
    “…These enhancements aim to achieve optimal routing scheduling based on risk information. At the same time, a reconfiguration algorithm for power optical communication networks, based on service priority, is proposed for specific service requests. …”
  2. 2

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

    Published 2025
    “…These enhancements aim to achieve optimal routing scheduling based on risk information. At the same time, a reconfiguration algorithm for power optical communication networks, based on service priority, is proposed for specific service requests. …”
  3. 3
  4. 4

    DATA. by Yang Yu (4292)

    Published 2025
    “…These enhancements aim to achieve optimal routing scheduling based on risk information. At the same time, a reconfiguration algorithm for power optical communication networks, based on service priority, is proposed for specific service requests. …”
  5. 5
  6. 6
  7. 7

    Convergence curve of the DBO algorithm. by Ma Haohao (22177538)

    Published 2025
    “…The improved Dung Beetle Optimization algorithm, Back Propagation Neural Network, Finite Element Analysis, and Response Surface Methodology provide a strong guarantee for the selection of robot polishing process parameters. …”
  8. 8
  9. 9
  10. 10

    Scatter diagram of different principal elements. by Jizhong Wang (7441697)

    Published 2025
    “…<div><p>A fault diagnosis method for oil immersed transformers based on principal component analysis and SSA LightGBM is proposed to address the problem of low diagnostic accuracy caused by the complexity of current oil immersed transformer faults. …”
  11. 11

    Business priorities. by Yang Yu (4292)

    Published 2025
    “…These enhancements aim to achieve optimal routing scheduling based on risk information. At the same time, a reconfiguration algorithm for power optical communication networks, based on service priority, is proposed for specific service requests. …”
  12. 12

    Topology of 14-node communication network. by Yang Yu (4292)

    Published 2025
    “…These enhancements aim to achieve optimal routing scheduling based on risk information. At the same time, a reconfiguration algorithm for power optical communication networks, based on service priority, is proposed for specific service requests. …”
  13. 13

    Changes of risk value under different parameters. by Yang Yu (4292)

    Published 2025
    “…These enhancements aim to achieve optimal routing scheduling based on risk information. At the same time, a reconfiguration algorithm for power optical communication networks, based on service priority, is proposed for specific service requests. …”
  14. 14

    Performance of active and standby paths. by Yang Yu (4292)

    Published 2025
    “…These enhancements aim to achieve optimal routing scheduling based on risk information. At the same time, a reconfiguration algorithm for power optical communication networks, based on service priority, is proposed for specific service requests. …”
  15. 15
  16. 16

    The general procedure of the proposed algorithm. by Shayesteh Tabatabaei (12280016)

    Published 2024
    “…For this purpose, this research article proposes a clustering-based routing protocol aimed at maximizing the delivery of data samples while minimizing energy consumption and data collection delays. …”
  17. 17

    Simulation and experimental research route. by Wanjun Zhang (496858)

    Published 2025
    “…This study introduces the LuGre friction model to describe these phenomena mathematically and proposes an improved genetic algorithm (GA) for precise parameter identification. …”
  18. 18

    The technical route of the study. by Hongliang Zou (20707270)

    Published 2025
    “…In addition, the method achieved lower mean absolute trajectory errors and root mean square errors compared to other algorithms evaluated on the urban navigation dataset. …”
  19. 19
  20. 20