Search alternatives:
process optimization » model optimization (Expand Search)
edge process » due process (Expand Search), edge processing (Expand Search), peace process (Expand Search)
binary wave » binary image (Expand Search)
wave global » yale global (Expand Search), waqi global (Expand Search), based global (Expand Search)
binary edge » binary image (Expand Search)
Showing 1 - 19 results of 19 for search '(( binary wave global optimization algorithm ) OR ( binary edge process optimization algorithm ))*', query time: 0.37s 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
    Image1_Applying the Hubbard-Stratonovich Transformation to Solve Scheduling Problems Under Inequality Constraints With Quantum Annealing.TIF

    Image1_Applying the Hubbard-Stratonovich Transformation to Solve Scheduling Problems Under Inequality Constraints With Quantum Annealing.TIF by Sizhuo Yu (11429743)

    Published 2021
    “…<p>Quantum annealing is a global optimization algorithm that uses the quantum tunneling effect to speed-up the search for an optimal solution. …”
    Save to List
    Saved in:
  16. 16
    Image3_Applying the Hubbard-Stratonovich Transformation to Solve Scheduling Problems Under Inequality Constraints With Quantum Annealing.TIF

    Image3_Applying the Hubbard-Stratonovich Transformation to Solve Scheduling Problems Under Inequality Constraints With Quantum Annealing.TIF by Sizhuo Yu (11429743)

    Published 2021
    “…<p>Quantum annealing is a global optimization algorithm that uses the quantum tunneling effect to speed-up the search for an optimal solution. …”
    Save to List
    Saved in:
  17. 17
    Image2_Applying the Hubbard-Stratonovich Transformation to Solve Scheduling Problems Under Inequality Constraints With Quantum Annealing.TIF

    Image2_Applying the Hubbard-Stratonovich Transformation to Solve Scheduling Problems Under Inequality Constraints With Quantum Annealing.TIF by Sizhuo Yu (11429743)

    Published 2021
    “…<p>Quantum annealing is a global optimization algorithm that uses the quantum tunneling effect to speed-up the search for an optimal solution. …”
    Save to List
    Saved in:
  18. 18
    DataSheet1_Applying the Hubbard-Stratonovich Transformation to Solve Scheduling Problems Under Inequality Constraints With Quantum Annealing.pdf

    DataSheet1_Applying the Hubbard-Stratonovich Transformation to Solve Scheduling Problems Under Inequality Constraints With Quantum Annealing.pdf by Sizhuo Yu (11429743)

    Published 2021
    “…<p>Quantum annealing is a global optimization algorithm that uses the quantum tunneling effect to speed-up the search for an optimal solution. …”
    Save to List
    Saved in:
  19. 19
    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: