Showing 13,001 - 13,020 results of 15,618 for search 'computing optimizing 4', query time: 0.28s Refine Results
  1. 13001
  2. 13002
  3. 13003
  4. 13004

    Multi-Scenario Robust Distributed Permutation Flow Shop Scheduling Based on DDQN by Shilong Guo, Ming Chen

    Published 2025-06-01
    “…After 2000 iterations, the DDQN algorithm achieves a 15% reduction in makespan with only a 2.5% increase in computational time compared to random search, this joint simulation system offers an efficient and stable solution for the modeling and optimization of the MSRDPFSP issue.…”
    Get full text
    Article
  5. 13005
  6. 13006
  7. 13007
  8. 13008

    The effect of malaria prevention and control interventions on malaria morbidity among children under 5 years and pregnant women in Kintampo North Municipality, Ghana by Christopher Tamal, Chrysantus Kubio, Delia Akosua Bandoh, Maurice Owiny, Ernest Kenu, Edwin Andrew Afari, Samuel Oko Sackey, Donne Kofi Ameme, Priscillia Nortey, Timothy Letsa, Alice Vorleto, Charles Gyamfi, Isaac Addisi

    Published 2019-04-01
    “…IPTp5 (fifth dose) increased from 0.7% in 2014 to 4.8% in 2016. A percentage increase in the coverage of only IPTp4 was associated with a reduction of malaria in pregnancy by two episodes (R2 = 0.34, 95% CI = ─ 1.68 – (─0.78). …”
    Get full text
    Article
  9. 13009

    Study on Lightweight Bridge Crack Detection Algorithm Based on YOLO11 by Xuwei Dong, Jiashuo Yuan, Jinpeng Dai

    Published 2025-05-01
    “…It reduces the model’s parameters and computations whilst preserving accuracy, thereby achieving a lightweight model. …”
    Get full text
    Article
  10. 13010
  11. 13011
  12. 13012
  13. 13013
  14. 13014

    PAPR Performance Evaluation of OFDM, RPDM, and ORPDM Multicarrier Modulation Schemes by Shaik Basheeruddin Shah, Nazar T. Ali, Goli Srikanth, Ahmed Altunaiji, Dragan I. Olcan

    Published 2025-01-01
    “…Our theoretical and numerical analyses reveal: 1) RPDM and ORPDM consistently provide lower PAPR than OFDM; 2) For prime q, RPDM provides the lowest PAPR; 3) For prime power <inline-formula> <tex-math notation="LaTeX">$(q=p^{m})$ </tex-math></inline-formula>, ORPDM excels for smaller prime powers <inline-formula> <tex-math notation="LaTeX">$(p\lt 7)$ </tex-math></inline-formula>, while RPDM is superior when <inline-formula> <tex-math notation="LaTeX">$p\geq 7$ </tex-math></inline-formula>; 4) For composite q, if all prime factors are <inline-formula> <tex-math notation="LaTeX">$\leq 5$ </tex-math></inline-formula>, ORPDM achieves the best PAPR reduction; if all prime factors are <inline-formula> <tex-math notation="LaTeX">$\geq 7$ </tex-math></inline-formula>, RPDM remains optimal. …”
    Get full text
    Article
  15. 13015
  16. 13016
  17. 13017
  18. 13018
  19. 13019
  20. 13020