Showing 1 - 20 results of 324 for search '(( binary task model optimization algorithm ) OR ( data sampling design optimization algorithm ))*', query time: 0.81s Refine Results
  1. 1
  2. 2
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8

    AUW-CE Mining Algorithms & Dataset Hub by Shuaikang Yuan (21091847)

    Published 2025
    “…Moreover, in response to the limitations of conventional cross-entropy methods for HUCPM, four core optimization strategies are designed: optimization of the initial probability distribution to guide the search direction, enhancement of sample diversity to prevent local convergence, dynamic adjustment of sample size to reduce redundant calculations, and incorporation of utility weights to improve the accuracy of probability updates. …”
  9. 9
  10. 10
  11. 11

    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.  …”
  12. 12

    PANet network design. by Mengqi Yuan (4852555)

    Published 2025
    “…Second, a dynamic up-sampling technique was introduced to improve the model’s ability to recover fine details. …”
  13. 13

    BiFPN network design. by Mengqi Yuan (4852555)

    Published 2025
    “…Second, a dynamic up-sampling technique was introduced to improve the model’s ability to recover fine details. …”
  14. 14

    The Pseudo-Code of the IRBMO Algorithm. by Chenyi Zhu (9383370)

    Published 2025
    “…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”
  15. 15

    Accelerated Design for High-Entropy Alloys Based on Machine Learning and Multiobjective Optimization by Yingying Ma (3617810)

    Published 2023
    “…Notably, the <i>D</i> of three candidates have shown significant improvements compared to the samples with similar <i>H</i> in the original data sets, with increases of 135.8, 282.4, and 194.1% respectively. …”
  16. 16

    Accelerated Design for High-Entropy Alloys Based on Machine Learning and Multiobjective Optimization by Yingying Ma (3617810)

    Published 2023
    “…Notably, the <i>D</i> of three candidates have shown significant improvements compared to the samples with similar <i>H</i> in the original data sets, with increases of 135.8, 282.4, and 194.1% respectively. …”
  17. 17
  18. 18
  19. 19

    IRBMO vs. meta-heuristic algorithms boxplot. by Chenyi Zhu (9383370)

    Published 2025
    “…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”
  20. 20

    IRBMO vs. feature selection algorithm boxplot. by Chenyi Zhu (9383370)

    Published 2025
    “…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”