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)
design optimization » bayesian optimization (Expand Search)
data process » data processing (Expand Search), damage process (Expand Search), data access (Expand Search)
binary plot » binary plddt (Expand Search), binary depot (Expand Search)
plot design » block design (Expand Search)
binary data » primary data (Expand Search), dietary data (Expand Search)
Showing 1 - 15 results of 15 for search '(( binary plot design optimization algorithm ) OR ( binary data process optimisation algorithm ))', query time: 1.05s Refine Results
  1. 1
    Analysis and design of algorithms for the manufacturing process of integrated circuits

    Analysis and design of algorithms for the manufacturing process of integrated circuits by Sonia Fleytas (16856403)

    Published 2023
    Save to List
    Saved in:
  2. 2
    Box plots with swarm overlays for six feature selection algorithms, annotated with mean and standard deviation values.

    Box plots with swarm overlays for six feature selection algorithms, annotated with mean and standard deviation values. by Doaa Sami Khafaga (21463870)

    Published 2025
    Save to List
    Saved in:
  3. 3
    Line plots showing performance trends for six evaluation metrics across CNN combined with different bio-inspired optimization algorithms.

    Line plots showing performance trends for six evaluation metrics across CNN combined with different bio-inspired optimization algorithms. by Doaa Sami Khafaga (21463870)

    Published 2025
    Save to List
    Saved in:
  4. 4
    Density distribution plot of performance metrics for various feature selection algorithms: bOcOA, bPSO, bGWO, bFA, bGA, and bWAO.

    Density distribution plot of performance metrics for various feature selection algorithms: bOcOA, bPSO, bGWO, bFA, bGA, and bWAO. by Doaa Sami Khafaga (21463870)

    Published 2025
    Save to List
    Saved in:
  5. 5
    A radar plot illustrating the comparison of the classification accuracy, cost values, and fitness values for the hybrids of BEOSA when applied to some high-dimensional datasets using a variation of 50 and 100 population sizes.

    A radar plot illustrating the comparison of the classification accuracy, cost values, and fitness values for the hybrids of BEOSA when applied to some high-dimensional datasets usi... by Olaide N. Oyelade (14047002)

    Published 2023
    Save to List
    Saved in:
  6. 6
    A radar plot illustrating the comparison of the classification accuracy, cost values, and fitness values for the hybrids of BEOSA when applied to some medium-sized dimensional datasets using a variation of 50 and 100 population sizes.

    A radar plot illustrating the comparison of the classification accuracy, cost values, and fitness values for the hybrids of BEOSA when applied to some medium-sized dimensional data... by Olaide N. Oyelade (14047002)

    Published 2023
    Save to List
    Saved in:
  7. 7
    A radar plot illustrating the comparison of the classification accuracy, cost values, and fitness values for the hybrids of BEOSA when applied to some small-sized dimensional datasets using a variation of 50 and 100 population sizes.

    A radar plot illustrating the comparison of the classification accuracy, cost values, and fitness values for the hybrids of BEOSA when applied to some small-sized dimensional datas... by Olaide N. Oyelade (14047002)

    Published 2023
    Save to List
    Saved in:
  8. 8
    Fig 4 -

    Fig 4 - by Olaide N. Oyelade (14047002)

    Published 2023
    Save to List
    Saved in:
  9. 9
    Fig 7 -

    Fig 7 - by Olaide N. Oyelade (14047002)

    Published 2023
    Save to List
    Saved in:
  10. 10
    Scheduling method for pairing night-shift and morning-shift duties on metro lines with complex structure

    Scheduling method for pairing night-shift and morning-shift duties on metro lines with complex structure by Zixuan Zhu (4224532)

    Published 2022
    “…To improve the rest time of crews, this paper proposes a binary programming model to optimise the NMDPP. Moreover, a hybrid algorithm combining General Variable Neighbourhood Search (GVNS) with an Assignment Algorithm is designed to find high-quality solutions for this problem. …”
    Save to List
    Saved in:
  11. 11
    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. Finally, the plot of location feature distance illustrates that CBFD exhibits minimal distance compared to DITF and Histogram of Oriented Gradients (HOG). …”
    Save to List
    Saved in:
  12. 12
    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. Finally, the plot of location feature distance illustrates that CBFD exhibits minimal distance compared to DITF and Histogram of Oriented Gradients (HOG). …”
    Save to List
    Saved in:
  13. 13
    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. Finally, the plot of location feature distance illustrates that CBFD exhibits minimal distance compared to DITF and Histogram of Oriented Gradients (HOG). …”
    Save to List
    Saved in:
  14. 14
    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. Finally, the plot of location feature distance illustrates that CBFD exhibits minimal distance compared to DITF and Histogram of Oriented Gradients (HOG). …”
    Save to List
    Saved in:
  15. 15
    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. Finally, the plot of location feature distance illustrates that CBFD exhibits minimal distance compared to DITF and Histogram of Oriented Gradients (HOG). …”
    Save to List
    Saved in:

Search Tools: