يعرض 181 - 200 نتائج من 1,046 نتيجة بحث عن '(( element method algorithm ) OR ((( data encoding algorithm ) OR ( path finding algorithm ))))', وقت الاستعلام: 0.50s تنقيح النتائج
  1. 181
  2. 182
  3. 183
  4. 184
  5. 185

    Path smoothing. حسب Yu Gu (162342)

    منشور في 2025
    "…Divide the entire path planning process into two stages: quickly finding the initial path and optimizing the path. …"
  6. 186
  7. 187
  8. 188

    G R code algorithm. حسب R. Sakthivel (2589547)

    منشور في 2024
    "…<div><p>Loss-less data compression becomes the need of the hour for effective data compression and computation in VLSI test vector generation and testing in addition to hardware AI/ML computations. …"
  9. 189
  10. 190
  11. 191

    Coprime array with interpolated array elements. حسب Chuanxi Xing (20141665)

    منشور في 2024
    "…Furthermore, the estimation of the DOA can be accurately carried out under low signal-to-noise ratio conditions. This method effectively utilizes the degrees of freedom provided by the virtual array, reducing noise interference, and exhibiting better performance in terms of positioning accuracy and algorithm stability.…"
  12. 192
  13. 193
  14. 194
  15. 195

    Planning data for different plots. حسب Manxian Yang (20521600)

    منشور في 2025
    "…In the context of multi-machine scheduling, the BNSGA-III algorithm outperforms the NSGA-II, NSGA-III, and MOEA/D algorithms, achieving improvements in total travel distance (12.3% to 34.4%), path balance (60.9% to 66.2%), and workload distribution (78.7% to 92.9%). …"
  16. 196

    Common turning methods. حسب Manxian Yang (20521600)

    منشور في 2025
    "…In the context of multi-machine scheduling, the BNSGA-III algorithm outperforms the NSGA-II, NSGA-III, and MOEA/D algorithms, achieving improvements in total travel distance (12.3% to 34.4%), path balance (60.9% to 66.2%), and workload distribution (78.7% to 92.9%). …"
  17. 197

    Schematic diagram of AIC operation. حسب Manxian Yang (20521600)

    منشور في 2025
    "…In the context of multi-machine scheduling, the BNSGA-III algorithm outperforms the NSGA-II, NSGA-III, and MOEA/D algorithms, achieving improvements in total travel distance (12.3% to 34.4%), path balance (60.9% to 66.2%), and workload distribution (78.7% to 92.9%). …"
  18. 198

    Partial field data of Huaxing Farm. حسب Manxian Yang (20521600)

    منشور في 2025
    "…In the context of multi-machine scheduling, the BNSGA-III algorithm outperforms the NSGA-II, NSGA-III, and MOEA/D algorithms, achieving improvements in total travel distance (12.3% to 34.4%), path balance (60.9% to 66.2%), and workload distribution (78.7% to 92.9%). …"
  19. 199

    Different operating angles θ = 90°, θ = 180°. حسب Manxian Yang (20521600)

    منشور في 2025
    "…In the context of multi-machine scheduling, the BNSGA-III algorithm outperforms the NSGA-II, NSGA-III, and MOEA/D algorithms, achieving improvements in total travel distance (12.3% to 34.4%), path balance (60.9% to 66.2%), and workload distribution (78.7% to 92.9%). …"
  20. 200

    Farm land preparation operation scheduling plan. حسب Manxian Yang (20521600)

    منشور في 2025
    "…In the context of multi-machine scheduling, the BNSGA-III algorithm outperforms the NSGA-II, NSGA-III, and MOEA/D algorithms, achieving improvements in total travel distance (12.3% to 34.4%), path balance (60.9% to 66.2%), and workload distribution (78.7% to 92.9%). …"