Showing 1 - 20 results of 27 for search '(( binary task d optimization algorithm ) OR ( binary data across optimization algorithm ))', query time: 0.56s Refine Results
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7

    Thesis-RAMIS-Figs_Slides by Felipe Santibañez-Leal (10967991)

    Published 2024
    “…<pre>Figures at Thesis_RAMIS/Figs_PI related with PhD Thesis:<br><br>AN INFORMATION-THEORETIC SAMPLING STRATEGY FOR THE RECOVERY OF GEOLOGICAL IMAGES: MODELING, ANALYSIS, AND IMPLEMENTATION<br><br>Data for the <a href="https://github.com/fsantibanezleal/FASL_Thesis_RAMIS" rel="noreferrer" target="_blank">LaTeX </a>version of the document<br><br>In this thesis the role of preferential sampling has been systematically addressed for the task of geological facies recovery using multiple-point simulation (\emph{<i>MPS</i>}) and for the problem of short-term planning in mining.  …”
  8. 8

    Flow diagram of the proposed model. by Uğur Ejder (22683228)

    Published 2025
    “…Local Interpretable Model-agnostic Explanations (LIME) were applied to improve interpretability. Across all algorithm models, LR–ABC hybrids outperformed their baseline models (e.g., Random Forest: 85.2% → 91.36% accuracy). …”
  9. 9
  10. 10

    Triplet Matching for Estimating Causal Effects With Three Treatment Arms: A Comparative Study of Mortality by Trauma Center Level by Giovanni Nattino (561797)

    Published 2021
    “…Our algorithm outperforms the nearest neighbor algorithm and is shown to produce matched samples with total distance no larger than twice the optimal distance. …”
  11. 11
  12. 12

    Generalized Tensor Decomposition With Features on Multiple Modes by Jiaxin Hu (1327875)

    Published 2021
    “…Our proposal handles a broad range of data types, including continuous, count, and binary observations. …”
  13. 13
  14. 14
  15. 15

    Event-driven data flow processing. by Yixian Wen (12201388)

    Published 2025
    “…Subsequently, we implement an optimal binary tree decision-making algorithm, grounded in dynamic programming, to achieve precise allocation of elastic resources within data streams, significantly bolstering resource utilization. …”
  16. 16
  17. 17

    Confusion matrix. by Yixian Wen (12201388)

    Published 2025
    “…Subsequently, we implement an optimal binary tree decision-making algorithm, grounded in dynamic programming, to achieve precise allocation of elastic resources within data streams, significantly bolstering resource utilization. …”
  18. 18

    Parameter settings. by Yixian Wen (12201388)

    Published 2025
    “…Subsequently, we implement an optimal binary tree decision-making algorithm, grounded in dynamic programming, to achieve precise allocation of elastic resources within data streams, significantly bolstering resource utilization. …”
  19. 19

    Dynamic resource allocation process. by Yixian Wen (12201388)

    Published 2025
    “…Subsequently, we implement an optimal binary tree decision-making algorithm, grounded in dynamic programming, to achieve precise allocation of elastic resources within data streams, significantly bolstering resource utilization. …”
  20. 20

    PathOlOgics_RBCs Python Scripts.zip by Ahmed Elsafty (16943883)

    Published 2023
    “…</p><p dir="ltr">In terms of classification, a second algorithm was developed and employed to preliminary sort or group the individual cells (after excluding the overlapping cells manually) into different categories using five geometric measurements applied to the extracted contour from each binary image mask (see PathOlOgics_script_2; preliminary shape measurements). …”