Search alternatives:
based optimization » whale optimization (Expand Search)
loop optimization » codon optimization (Expand Search), wolf optimization (Expand Search), lead optimization (Expand Search)
binary ms » binary mask (Expand Search), binary _ (Expand Search), binary b (Expand Search)
Showing 1 - 8 results of 8 for search '(( binary class loop optimization algorithm ) OR ( binary ms based optimization algorithm ))*', query time: 0.75s 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
    Programs to evaluate superoptimizer STOKE.

    Programs to evaluate superoptimizer STOKE. by Przemysław Kowalewski (12893507)

    Published 2022
    “…The goal of this paper is to check these claims. In this paper classes of programs that STOKE may handle particularly well and any class of programs that stochastic optimization might not be able to handle will be identified. …”
    Save to List
    Saved in:
  4. 4
    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:
  5. 5
    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:
  6. 6
    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:
  7. 7
    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:
  8. 8
    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: