Search alternatives:
derived optimization » driven optimization (Expand Search), required optimization (Expand Search), design optimization (Expand Search)
process optimization » model optimization (Expand Search)
edge process » due process (Expand Search), edge processing (Expand Search), peace process (Expand Search)
its derived » ipsc derived (Expand Search), i derived (Expand Search), hipsc derived (Expand Search)
binary edge » binary image (Expand Search)
binary its » binary pairs (Expand Search)
Showing 1 - 16 results of 16 for search '(( binary its derived optimization algorithm ) OR ( binary edge process optimization algorithm ))', query time: 0.95s Refine Results
  1. 1
    Proposed Algorithm.

    Proposed Algorithm. by Hend Bayoumi (22693738)

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

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

    Published 2025
    Subjects:
    Save to List
    Saved in:
  3. 3
    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:
  4. 4
    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:
  5. 5
    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:
  6. 6
    Related Work Summary.

    Related Work Summary. by Hend Bayoumi (22693738)

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

    Simulation parameters. by Hend Bayoumi (22693738)

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

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

    Published 2025
    Subjects:
    Save to List
    Saved in:
  9. 9
    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:
  10. 10
    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:
  11. 11
    Normalized computation rate for N = 10.

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

    Published 2025
    Subjects:
    Save to List
    Saved in:
  12. 12
    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:
  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
    Supplementary Material for: Penalized Logistic Regression Analysis for Genetic Association Studies of Binary Phenotypes

    Supplementary Material for: Penalized Logistic Regression Analysis for Genetic Association Studies of Binary Phenotypes by Yu Y. (3096192)

    Published 2022
    “…We consider two approximate approaches to maximizing the marginal likelihood: (i) a Monte Carlo EM algorithm (MCEM) and (ii) a Laplace approximation (LA) to each integral, followed by derivative-free optimization of the approximation. …”
    Save to List
    Saved in:
  16. 16
    PathOlOgics_RBCs Python Scripts.zip

    PathOlOgics_RBCs Python Scripts.zip by Ahmed Elsafty (16943883)

    Published 2023
    “…This process generated a ground-truth binary semantic segmentation mask and determined the bounding box coordinates (XYWH) for each cell. …”
    Save to List
    Saved in:

Search Tools: