Search alternatives:
process optimization » robust optimization (Expand Search), model optimization (Expand Search), policy optimization (Expand Search)
design optimization » bayesian optimization (Expand Search)
binary simple » binary image (Expand Search), binary people (Expand Search)
simple design » sample design (Expand Search)
task process » based process (Expand Search), basic process (Expand Search), a process (Expand Search)
binary task » binary mask (Expand Search)
Showing 1 - 18 results of 18 for search '(( binary task process optimization algorithm ) OR ( binary simple design optimization algorithm ))', query time: 0.51s Refine Results
  1. 1
    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:
  2. 2
    Proposed Algorithm.

    Proposed Algorithm. 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
    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:
  5. 5
    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:
  6. 6
    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:
  7. 7
    The workflow diagram for the gene expression biomarker study which involve using principal component analysis (PCA) to reduce the number of features (principal components), thus requiring fewer qubits.

    The workflow diagram for the gene expression biomarker study which involve using principal component analysis (PCA) to reduce the number of features (principal components), thus re... by Aninda Astuti (21736334)

    Published 2025
    Save to List
    Saved in:
  8. 8
    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:
  9. 9
    Related Work Summary.

    Related Work Summary. by Hend Bayoumi (22693738)

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

    Simulation parameters. by Hend Bayoumi (22693738)

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

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

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

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

    Published 2025
    Subjects:
    Save to List
    Saved in:
  15. 15
    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:
  16. 16
    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:
  17. 17
    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:
  18. 18
    Models and Dataset

    Models and Dataset by M RN (9866504)

    Published 2025
    “…</p><p dir="ltr"><br></p><p dir="ltr"><b>RAO (Rao Optimization Algorithm):</b><br>RAO is a parameter-less optimization algorithm that updates solutions based on simple arithmetic operations involving the best and worst individuals in the population. …”
    Save to List
    Saved in:

Search Tools: