Search alternatives:
processing optimization » process optimization (Expand Search), process optimisation (Expand Search), routing optimization (Expand Search)
d optimization » _ optimization (Expand Search), b optimization (Expand Search), led optimization (Expand Search)
binary task » binary mask (Expand Search)
task d » task dt (Expand Search), task _ (Expand Search), task 1 (Expand Search)
Showing 21 - 27 results of 27 for search '(( binary task d optimization algorithm ) OR ( binary image processing optimization algorithm ))', query time: 1.00s Refine Results
  1. 21
    Image1_Applying the Hubbard-Stratonovich Transformation to Solve Scheduling Problems Under Inequality Constraints With Quantum Annealing.TIF

    Image1_Applying the Hubbard-Stratonovich Transformation to Solve Scheduling Problems Under Inequality Constraints With Quantum Annealing.TIF by Sizhuo Yu (11429743)

    Published 2021
    Save to List
    Saved in:
  2. 22
    Image3_Applying the Hubbard-Stratonovich Transformation to Solve Scheduling Problems Under Inequality Constraints With Quantum Annealing.TIF

    Image3_Applying the Hubbard-Stratonovich Transformation to Solve Scheduling Problems Under Inequality Constraints With Quantum Annealing.TIF by Sizhuo Yu (11429743)

    Published 2021
    Save to List
    Saved in:
  3. 23
    Image2_Applying the Hubbard-Stratonovich Transformation to Solve Scheduling Problems Under Inequality Constraints With Quantum Annealing.TIF

    Image2_Applying the Hubbard-Stratonovich Transformation to Solve Scheduling Problems Under Inequality Constraints With Quantum Annealing.TIF by Sizhuo Yu (11429743)

    Published 2021
    Save to List
    Saved in:
  4. 24
    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:
  5. 25
    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:
  6. 26
    Fig 12 -

    Fig 12 - by Nisha Yadav (366131)

    Published 2024
    Save to List
    Saved in:
  7. 27
    Fortran & C++: design fractal-type optical diffractive element

    Fortran & C++: design fractal-type optical diffractive element by I-Lin Ho (13768960)

    Published 2022
    “…</p> <p>(2) calculate diffraction fields for fractal and/or grid-matrix (binary) phase-holograms.</p> <p>(3) optimize the fractal and/or grid-matrix holograms for given target diffraction images, using annealing algorithms. …”
    Save to List
    Saved in:

Search Tools: