Showing 21 - 40 results of 56 for search '(( library based processes optimization algorithm ) OR ( binary b while optimization algorithm ))*', query time: 1.15s Refine Results
  1. 21

    FEP Augmentation as a Means to Solve Data Paucity Problems for Machine Learning in Chemical Biology by Pieter B. Burger (4172578)

    Published 2024
    “…Ultimately, the study advocates for the synergy of physics-based methods and ML to expedite the lead optimization process. …”
  2. 22

    FEP Augmentation as a Means to Solve Data Paucity Problems for Machine Learning in Chemical Biology by Pieter B. Burger (4172578)

    Published 2024
    “…Ultimately, the study advocates for the synergy of physics-based methods and ML to expedite the lead optimization process. …”
  3. 23

    FEP Augmentation as a Means to Solve Data Paucity Problems for Machine Learning in Chemical Biology by Pieter B. Burger (4172578)

    Published 2024
    “…Ultimately, the study advocates for the synergy of physics-based methods and ML to expedite the lead optimization process. …”
  4. 24

    FEP Augmentation as a Means to Solve Data Paucity Problems for Machine Learning in Chemical Biology by Pieter B. Burger (4172578)

    Published 2024
    “…Ultimately, the study advocates for the synergy of physics-based methods and ML to expedite the lead optimization process. …”
  5. 25

    FEP Augmentation as a Means to Solve Data Paucity Problems for Machine Learning in Chemical Biology by Pieter B. Burger (4172578)

    Published 2024
    “…Ultimately, the study advocates for the synergy of physics-based methods and ML to expedite the lead optimization process. …”
  6. 26

    A simple HFS instance. by Xiang Tian (4369285)

    Published 2025
    “…Secondly, based on the data libraries of the IPMMPO, two tuple sets suitable for constraint programming modeling are further designed as data preprocessing. …”
  7. 27

    The scheduling Gantt chart. by Xiang Tian (4369285)

    Published 2025
    “…Secondly, based on the data libraries of the IPMMPO, two tuple sets suitable for constraint programming modeling are further designed as data preprocessing. …”
  8. 28

    Structure and computational framework of IPMMPO. by Xiang Tian (4369285)

    Published 2025
    “…Secondly, based on the data libraries of the IPMMPO, two tuple sets suitable for constraint programming modeling are further designed as data preprocessing. …”
  9. 29

    Data types contained in and . by Xiang Tian (4369285)

    Published 2025
    “…Secondly, based on the data libraries of the IPMMPO, two tuple sets suitable for constraint programming modeling are further designed as data preprocessing. …”
  10. 30

    Data construction of the first and last rows in . by Xiang Tian (4369285)

    Published 2025
    “…Secondly, based on the data libraries of the IPMMPO, two tuple sets suitable for constraint programming modeling are further designed as data preprocessing. …”
  11. 31

    Schematic diagram of PM model. by Xiang Tian (4369285)

    Published 2025
    “…Secondly, based on the data libraries of the IPMMPO, two tuple sets suitable for constraint programming modeling are further designed as data preprocessing. …”
  12. 32

    Schematic diagram of the atomic function . by Xiang Tian (4369285)

    Published 2025
    “…Secondly, based on the data libraries of the IPMMPO, two tuple sets suitable for constraint programming modeling are further designed as data preprocessing. …”
  13. 33

    Multiple comparison of means - Tukey HSD. by Xiang Tian (4369285)

    Published 2025
    “…Secondly, based on the data libraries of the IPMMPO, two tuple sets suitable for constraint programming modeling are further designed as data preprocessing. …”
  14. 34

    Schematic diagram of the cut-and-mark operation. by Xiang Tian (4369285)

    Published 2025
    “…Secondly, based on the data libraries of the IPMMPO, two tuple sets suitable for constraint programming modeling are further designed as data preprocessing. …”
  15. 35

    Layout of hybrid flow shop scheduling. by Xiang Tian (4369285)

    Published 2025
    “…Secondly, based on the data libraries of the IPMMPO, two tuple sets suitable for constraint programming modeling are further designed as data preprocessing. …”
  16. 36

    Probe combines and as a 2-aggregation. by Xiang Tian (4369285)

    Published 2025
    “…Secondly, based on the data libraries of the IPMMPO, two tuple sets suitable for constraint programming modeling are further designed as data preprocessing. …”
  17. 37

    Scheduling Gantt chart for instance j10c10c6. by Xiang Tian (4369285)

    Published 2025
    “…Secondly, based on the data libraries of the IPMMPO, two tuple sets suitable for constraint programming modeling are further designed as data preprocessing. …”
  18. 38

    Scheduling Gantt chart for instance j30c5e10. by Xiang Tian (4369285)

    Published 2025
    “…Secondly, based on the data libraries of the IPMMPO, two tuple sets suitable for constraint programming modeling are further designed as data preprocessing. …”
  19. 39

    Box plot comparison on instance j30c5e10. by Xiang Tian (4369285)

    Published 2025
    “…Secondly, based on the data libraries of the IPMMPO, two tuple sets suitable for constraint programming modeling are further designed as data preprocessing. …”
  20. 40

    Improved support vector machine classification algorithm based on adaptive feature weight updating in the Hadoop cluster environment by Jianfang Cao (1881379)

    Published 2019
    “…<div><p>An image classification algorithm based on adaptive feature weight updating is proposed to address the low classification accuracy of the current single-feature classification algorithms and simple multifeature fusion algorithms. …”