Search alternatives:
design optimization » bayesian optimization (Expand Search)
b optimization » _ optimization (Expand Search), bboa optimization (Expand Search), fox optimization (Expand Search)
binary sample » final sample (Expand Search), binary people (Expand Search), intra sample (Expand Search)
sample design » sampling design (Expand Search)
binary task » binary mask (Expand Search)
task b » task _ (Expand Search), task 1 (Expand Search), task p (Expand Search)
Showing 1 - 20 results of 25 for search '(( binary task b optimization algorithm ) OR ( binary sample design optimization algorithm ))*', query time: 0.50s Refine Results
  1. 1
    Illustration of the transformed binary images of normal, benign, and malignant samples into grayscale.

    Illustration of the transformed binary images of normal, benign, and malignant samples into grayscale. by Tehnan I. A. Mohamed (16846175)

    Published 2023
    Save to List
    Saved in:
  2. 2
    Proposed Algorithm.

    Proposed Algorithm. by Hend Bayoumi (22693738)

    Published 2025
    Save to List
    Saved in:
  3. 3
    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
    Save to List
    Saved in:
  4. 4
    Comparisons between ADAM and NADAM optimizers.

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

    Published 2025
    Save to List
    Saved in:
  5. 5
    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
    Save to List
    Saved in:
  6. 6
    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
    Save to List
    Saved in:
  7. 7
    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
    Save to List
    Saved in:
  8. 8
    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:
  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
    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
    Save to List
    Saved in:
  11. 11
    An Example of a WPT-MEC Network.

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

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

    Related Work Summary. by Hend Bayoumi (22693738)

    Published 2025
    Save to List
    Saved in:
  13. 13
    Simulation parameters.

    Simulation parameters. by Hend Bayoumi (22693738)

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

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

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

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

    Published 2025
    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
    Save to List
    Saved in:
  17. 17
    Sample image for illustration.

    Sample image for illustration. by Indhumathi S. (19173013)

    Published 2024
    Save to List
    Saved in:
  18. 18
    Triplet Matching for Estimating Causal Effects With Three Treatment Arms: A Comparative Study of Mortality by Trauma Center Level

    Triplet Matching for Estimating Causal Effects With Three Treatment Arms: A Comparative Study of Mortality by Trauma Center Level by Giovanni Nattino (561797)

    Published 2021
    “…We fill the gap by developing an iterative matching algorithm for the three-group setting. Our algorithm outperforms the nearest neighbor algorithm and is shown to produce matched samples with total distance no larger than twice the optimal distance. …”
    Save to List
    Saved in:
  19. 19
    Thesis-RAMIS-Figs_Slides

    Thesis-RAMIS-Figs_Slides by Felipe Santibañez-Leal (10967991)

    Published 2024
    “…<br><br>Finally, although the developed concepts, ideas and algorithms have been developed for inverse problems in geostatistics, the results are applicable to a wide range of disciplines where similar sampling problems need to be faced, included but not limited to design of communication networks, optimal integration and communication of swarms of robots and drones, remote sensing.…”
    Save to List
    Saved in:
  20. 20
    Flowchart scheme of the ML-based model.

    Flowchart scheme of the ML-based model. by Noshaba Qasmi (20405009)

    Published 2024
    Save to List
    Saved in:

Search Tools: