Search alternatives:
guided optimization » based optimization (Expand Search), model optimization (Expand Search)
binary first » bars first (Expand Search), binary pairs (Expand Search)
first global » from global (Expand Search)
binary mask » binary image (Expand Search)
mask guided » marker guided (Expand Search), image guided (Expand Search)
Showing 1 - 7 results of 7 for search '(( binary mask guided optimization algorithm ) OR ( binary first global optimization algorithm ))', query time: 0.90s 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
    Validation of image processing steps and metric results using images of a microfluidic device.

    Validation of image processing steps and metric results using images of a microfluidic device. by Gavrielle R. Untracht (11820311)

    Published 2021
    Save to List
    Saved in:
  3. 3
    Flowchart of software workflow.

    Flowchart of software workflow. by Gavrielle R. Untracht (11820311)

    Published 2021
    Save to List
    Saved in:
  4. 4
    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
    “…<p>Quantum annealing is a global optimization algorithm that uses the quantum tunneling effect to speed-up the search for an optimal solution. …”
    Save to List
    Saved in:
  5. 5
    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
    “…<p>Quantum annealing is a global optimization algorithm that uses the quantum tunneling effect to speed-up the search for an optimal solution. …”
    Save to List
    Saved in:
  6. 6
    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
    “…<p>Quantum annealing is a global optimization algorithm that uses the quantum tunneling effect to speed-up the search for an optimal solution. …”
    Save to List
    Saved in:
  7. 7
    DataSheet1_Applying the Hubbard-Stratonovich Transformation to Solve Scheduling Problems Under Inequality Constraints With Quantum Annealing.pdf

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

    Published 2021
    “…<p>Quantum annealing is a global optimization algorithm that uses the quantum tunneling effect to speed-up the search for an optimal solution. …”
    Save to List
    Saved in:

Search Tools: