Search alternatives:
resource optimization » resource utilization (Expand Search), resource utilisation (Expand Search), resource limitations (Expand Search)
policy optimization » topology optimization (Expand Search), wolf optimization (Expand Search), process optimization (Expand Search)
task resource » a resource (Expand Search)
binary task » binary mask (Expand Search)
task policy » risk policy (Expand Search)
Showing 1 - 16 results of 16 for search '(( binary task resource optimization algorithm ) OR ( binary task policy optimization algorithm ))*', query time: 0.49s Refine Results
  1. 1
    Proposed Algorithm.

    Proposed Algorithm. by Hend Bayoumi (22693738)

    Published 2025
    Subjects:
    Save to List
    Saved in:
  2. 2
    CDF of task latency, approximated as the inverse of the achieved computation rate.

    CDF of task latency, approximated as the inverse of the achieved computation rate. by Hend Bayoumi (22693738)

    Published 2025
    Subjects:
    Save to List
    Saved in:
  3. 3
    Comparisons between ADAM and NADAM optimizers.

    Comparisons between ADAM and NADAM optimizers. by Hend Bayoumi (22693738)

    Published 2025
    Subjects:
    Save to List
    Saved in:
  4. 4
    Comparisons of computation rate performance for different offloading algorithms.for N = 10, 20, 30.

    Comparisons of computation rate performance for different offloading algorithms.for N = 10, 20, 30. by Hend Bayoumi (22693738)

    Published 2025
    Subjects:
    Save to List
    Saved in:
  5. 5
    Comparison of total time consumed for different offloading algorithms.for N = 10, 20, 30.

    Comparison of total time consumed for different offloading algorithms.for N = 10, 20, 30. by Hend Bayoumi (22693738)

    Published 2025
    Subjects:
    Save to List
    Saved in:
  6. 6
    An Example of a WPT-MEC Network.

    An Example of a WPT-MEC Network. by Hend Bayoumi (22693738)

    Published 2025
    Subjects:
    Save to List
    Saved in:
  7. 7
    Related Work Summary.

    Related Work Summary. by Hend Bayoumi (22693738)

    Published 2025
    Subjects:
    Save to List
    Saved in:
  8. 8
    Simulation parameters.

    Simulation parameters. by Hend Bayoumi (22693738)

    Published 2025
    Subjects:
    Save to List
    Saved in:
  9. 9
    Training losses for N = 10.

    Training losses for N = 10. by Hend Bayoumi (22693738)

    Published 2025
    Subjects:
    Save to List
    Saved in:
  10. 10
    Performance Comparison of State-of-the-Art WPT-MEC Offloading Methods.

    Performance Comparison of State-of-the-Art WPT-MEC Offloading Methods. by Hend Bayoumi (22693738)

    Published 2025
    Subjects:
    Save to List
    Saved in:
  11. 11
    The evolution of the Wireless Power Transfer (WPT) time fraction β over simulation frames.

    The evolution of the Wireless Power Transfer (WPT) time fraction β over simulation frames. by Hend Bayoumi (22693738)

    Published 2025
    Subjects:
    Save to List
    Saved in:
  12. 12
    Normalized computation rate for N = 10.

    Normalized computation rate for N = 10. by Hend Bayoumi (22693738)

    Published 2025
    Subjects:
    Save to List
    Saved in:
  13. 13
    Comparison between Bisection and Newton-Raphson in terms of (A) total time consumed, and (B) maximum computation rate.

    Comparison between Bisection and Newton-Raphson in terms of (A) total time consumed, and (B) maximum computation rate. by Hend Bayoumi (22693738)

    Published 2025
    Subjects:
    Save to List
    Saved in:
  14. 14
    Summary of Notations Used in this paper.

    Summary of Notations Used in this paper. by Hend Bayoumi (22693738)

    Published 2025
    Subjects:
    Save to List
    Saved in:
  15. 15
    Optimizing Kernel Transformations to Handle Binary Class Imbalanced Dataset Classification

    Optimizing Kernel Transformations to Handle Binary Class Imbalanced Dataset Classification by Vaibhavi Patel (19843282)

    Published 2024
    Save to List
    Saved in:
  16. 16
    An exemplar procedure for activity flow modeling based on the direct and shortest paths at a network density of 15%.

    An exemplar procedure for activity flow modeling based on the direct and shortest paths at a network density of 15%. by Zhengdong Wang (35299)

    Published 2025
    Save to List
    Saved in:

Search Tools: