يعرض 61 - 80 نتائج من 668 نتيجة بحث عن 'graph based algorithm', وقت الاستعلام: 0.11s تنقيح النتائج
  1. 61
  2. 62
  3. 63
  4. 64
  5. 65
  6. 66
  7. 67
  8. 68
  9. 69
  10. 70
  11. 71
  12. 72
  13. 73
  14. 74

    Convergence Iteration Graphs of f<sub>1</sub> and f<sub>2</sub> for Small-Scale Cases Based on the Improved NSGA-II Algorithm. حسب Huiyue Xu (12022388)

    منشور في 2025
    "…<p>Convergence Iteration Graphs of f<sub>1</sub> and f<sub>2</sub> for Small-Scale Cases Based on the Improved NSGA-II Algorithm.…"
  15. 75

    Convergence Iteration Graphs of f<sub>1</sub> and f<sub>2</sub> for Large-Scale Cases Based on the Improved NSGA-II Algorithm. حسب Huiyue Xu (12022388)

    منشور في 2025
    "…<p>Convergence Iteration Graphs of f<sub>1</sub> and f<sub>2</sub> for Large-Scale Cases Based on the Improved NSGA-II Algorithm.…"
  16. 76

    Convergence Iteration Graphs of f<sub>1</sub> and f<sub>2</sub> for Medium-Scale Cases Based on the Improved NSGA-II Algorithm. حسب Huiyue Xu (12022388)

    منشور في 2025
    "…<p>Convergence Iteration Graphs of f<sub>1</sub> and f<sub>2</sub> for Medium-Scale Cases Based on the Improved NSGA-II Algorithm.…"
  17. 77

    Rank sum data graph. حسب Yun Qi (560401)

    منشور في 2025
    "…Additionally, the average path length of MSWOA is 32.2% shorter than WOA, 40.5% shorter than WOA-1, and 41.4% shorter than PSO. The MSWOA algorithm generates the shortest and smoothest path among the tested methods.Based on the analysis of the path graph and iteration frequency graph, it is recommended to apply the MSWOA algorithm to path planning experiments. …"
  18. 78
  19. 79
  20. 80