Search alternatives:
based optimization » whale optimization (Expand Search)
task optimization » phase optimization (Expand Search), path optimization (Expand Search), dose optimization (Expand Search)
primary target » primary care (Expand Search)
target task » target case (Expand Search), target based (Expand Search), target trait (Expand Search)
binary ms » binary mask (Expand Search), binary _ (Expand Search), binary b (Expand Search)
Showing 1 - 9 results of 9 for search '(( binary ms based optimization algorithm ) OR ( primary target task optimization algorithm ))', query time: 0.58s Refine Results
  1. 1
    One advantage of our algorithm is that it is not binary in nature.

    One advantage of our algorithm is that it is not binary in nature. by Yong Kuk Kim (13955214)

    Published 2022
    Save to List
    Saved in:
  2. 2
    Several loop patterns found in binary code.

    Several loop patterns found in binary code. by Alba Pedro-Zapater (8600382)

    Published 2020
    Save to List
    Saved in:
  3. 3
    Machine learning deployment strategies and schematic illustration of the proposed generative adversarial algorithm for domain adaptation.

    Machine learning deployment strategies and schematic illustration of the proposed generative adversarial algorithm for domain adaptation. by Aly A. Valliani (13251484)

    Published 2022
    Save to List
    Saved in:
  4. 4
    The CaM objective spaces have low effective dimensionalities.

    The CaM objective spaces have low effective dimensionalities. by Lu Hong (399882)

    Published 2024
    Save to List
    Saved in:
  5. 5
    Sample image for illustration.

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

    Published 2024
    “…The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”
    Save to List
    Saved in:
  6. 6
    Comparison analysis of computation time.

    Comparison analysis of computation time. by Indhumathi S. (19173013)

    Published 2024
    “…The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”
    Save to List
    Saved in:
  7. 7
    Process flow diagram of CBFD.

    Process flow diagram of CBFD. by Indhumathi S. (19173013)

    Published 2024
    “…The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”
    Save to List
    Saved in:
  8. 8
    Precision recall curve.

    Precision recall curve. by Indhumathi S. (19173013)

    Published 2024
    “…The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”
    Save to List
    Saved in:
  9. 9
    Quadratic polynomial in 2D image plane.

    Quadratic polynomial in 2D image plane. by Indhumathi S. (19173013)

    Published 2024
    “…The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”
    Save to List
    Saved in:

Search Tools: