Search alternatives:
process optimization » model optimization (Expand Search)
based optimization » whale optimization (Expand Search)
based process » based processes (Expand Search), based probes (Expand Search), based proteins (Expand Search)
library based » laboratory based (Expand Search)
binary based » linac based (Expand Search), binary mask (Expand Search)
based based » based case (Expand Search), based basis (Expand Search), ranked based (Expand Search)
process optimization » model optimization (Expand Search)
based optimization » whale optimization (Expand Search)
based process » based processes (Expand Search), based probes (Expand Search), based proteins (Expand Search)
library based » laboratory based (Expand Search)
binary based » linac based (Expand Search), binary mask (Expand Search)
based based » based case (Expand Search), based basis (Expand Search), ranked based (Expand Search)
-
161
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. …”
-
162
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. …”
-
163
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. …”
-
164
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. …”
-
165
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. …”
-
166
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. …”
-
167
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. …”
-
168
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. …”
-
169
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. …”
-
170
-
171
iRaPCA and SOMoC: Development and Validation of Web Applications for New Approaches for the Clustering of Small Molecules
Published 2022“…Here, two open-source in-house methodologies for clustering of small molecules are presented: iterative Random subspace Principal Component Analysis clustering (iRaPCA), an iterative approach based on feature bagging, dimensionality reduction, and K-means optimization; and Silhouette Optimized Molecular Clustering (SOMoC), which combines molecular fingerprints with the Uniform Manifold Approximation and Projection (UMAP) and Gaussian Mixture Model algorithm (GMM). …”
-
172
iRaPCA and SOMoC: Development and Validation of Web Applications for New Approaches for the Clustering of Small Molecules
Published 2022“…Here, two open-source in-house methodologies for clustering of small molecules are presented: iterative Random subspace Principal Component Analysis clustering (iRaPCA), an iterative approach based on feature bagging, dimensionality reduction, and K-means optimization; and Silhouette Optimized Molecular Clustering (SOMoC), which combines molecular fingerprints with the Uniform Manifold Approximation and Projection (UMAP) and Gaussian Mixture Model algorithm (GMM). …”
-
173
iRaPCA and SOMoC: Development and Validation of Web Applications for New Approaches for the Clustering of Small Molecules
Published 2022“…Here, two open-source in-house methodologies for clustering of small molecules are presented: iterative Random subspace Principal Component Analysis clustering (iRaPCA), an iterative approach based on feature bagging, dimensionality reduction, and K-means optimization; and Silhouette Optimized Molecular Clustering (SOMoC), which combines molecular fingerprints with the Uniform Manifold Approximation and Projection (UMAP) and Gaussian Mixture Model algorithm (GMM). …”
-
174
Acceleration of Inverse Molecular Design by Using Predictive Techniques
Published 2019“…This study addresses one of the most important drawbacks inherently related to molecular searches in chemical compound space by greedy algorithms such as Best First Search and Genetic Algorithm, i.e., the large computational cost required to optimize one or more quantum-chemical properties. …”
-
175
-
176
-
177
<b>Portable Library for Homomorphic Encrypted Machine Learning on FPGA Accelerated Cloud Cyberinfrastructure</b>
Published 2023“…This project will leverage our novel algorithmic, architectural, and memory optimizations on FPGAs to develop a portable library to enable secure and trustworthy ML inference. …”
-
178
-
179
-
180