Search alternatives:
processes optimization » process optimization (Expand Search), process optimisation (Expand Search), property optimization (Expand Search)
while optimization » whale optimization (Expand Search), wolf optimization (Expand Search), phase optimization (Expand Search)
based processes » care processes (Expand Search)
library based » laboratory based (Expand Search)
binary b » binary _ (Expand Search)
b while » b whole (Expand Search), a while (Expand Search)
processes optimization » process optimization (Expand Search), process optimisation (Expand Search), property optimization (Expand Search)
while optimization » whale optimization (Expand Search), wolf optimization (Expand Search), phase optimization (Expand Search)
based processes » care processes (Expand Search)
library based » laboratory based (Expand Search)
binary b » binary _ (Expand Search)
b while » b whole (Expand Search), a while (Expand Search)
-
21
FEP Augmentation as a Means to Solve Data Paucity Problems for Machine Learning in Chemical Biology
Published 2024“…Ultimately, the study advocates for the synergy of physics-based methods and ML to expedite the lead optimization process. …”
-
22
FEP Augmentation as a Means to Solve Data Paucity Problems for Machine Learning in Chemical Biology
Published 2024“…Ultimately, the study advocates for the synergy of physics-based methods and ML to expedite the lead optimization process. …”
-
23
FEP Augmentation as a Means to Solve Data Paucity Problems for Machine Learning in Chemical Biology
Published 2024“…Ultimately, the study advocates for the synergy of physics-based methods and ML to expedite the lead optimization process. …”
-
24
FEP Augmentation as a Means to Solve Data Paucity Problems for Machine Learning in Chemical Biology
Published 2024“…Ultimately, the study advocates for the synergy of physics-based methods and ML to expedite the lead optimization process. …”
-
25
FEP Augmentation as a Means to Solve Data Paucity Problems for Machine Learning in Chemical Biology
Published 2024“…Ultimately, the study advocates for the synergy of physics-based methods and ML to expedite the lead optimization process. …”
-
26
A simple HFS instance.
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. …”
-
27
The scheduling Gantt chart.
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. …”
-
28
Structure and computational framework of IPMMPO.
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. …”
-
29
Data types contained in and .
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. …”
-
30
Data construction of the first and last rows in .
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. …”
-
31
Schematic diagram of PM model.
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. …”
-
32
Schematic diagram of the atomic function .
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. …”
-
33
Multiple comparison of means - Tukey HSD.
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. …”
-
34
Schematic diagram of the cut-and-mark operation.
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. …”
-
35
Layout of hybrid flow shop scheduling.
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. …”
-
36
Probe combines and as a 2-aggregation.
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. …”
-
37
Scheduling Gantt chart for instance j10c10c6.
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. …”
-
38
Scheduling Gantt chart for instance j30c5e10.
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. …”
-
39
Box plot comparison on instance j30c5e10.
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. …”
-
40
Improved support vector machine classification algorithm based on adaptive feature weight updating in the Hadoop cluster environment
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. …”