Search alternatives:
optimisation algorithm » optimization algorithms (Expand Search), maximization algorithm (Expand Search), identification algorithm (Expand Search)
process optimisation » process optimization (Expand Search), robust optimisation (Expand Search), process simulation (Expand Search)
based optimization » whale optimization (Expand Search)
sample process » simple process (Expand Search), same process (Expand Search), sample processing (Expand Search)
binary sample » final sample (Expand Search), binary people (Expand Search), intra sample (Expand Search)
binary ms » binary mask (Expand Search), binary _ (Expand Search), binary b (Expand Search)
Showing 1 - 7 results of 7 for search '(( binary ms based optimization algorithm ) OR ( binary sample process optimisation algorithm ))', query time: 0.88s 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
    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:
  4. 4
    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:
  5. 5
    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:
  6. 6
    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:
  7. 7
    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: