Search alternatives:
design optimization » bayesian optimization (Expand Search)
library based » laboratory based (Expand Search)
Showing 1 - 20 results of 37 for search 'library based design optimization algorithm', query time: 0.18s Refine Results
  1. 1
    RosettaAMRLD: A Reaction-Driven Approach for Structure-Based Drug Design from Combinatorial Libraries with Monte Carlo Metropolis Algorithms

    RosettaAMRLD: A Reaction-Driven Approach for Structure-Based Drug Design from Combinatorial Libraries with Monte Carlo Metropolis Algorithms by Yidan Tang (6623693)

    Published 2025
    “…The Rosetta automated Monte Carlo reaction-based ligand design (RosettaAMRLD) integrates a Monte Carlo Metropolis (MCM) algorithm and reaction-driven molecule proposal to enhance structure-based <i>de novo</i> drug discovery. …”
    Save to List
    Saved in:
  2. 2
    Face recognition algorithm flow based on the PCA.

    Face recognition algorithm flow based on the PCA. by Na Lin (69470)

    Published 2025
    Save to List
    Saved in:
  3. 3
    An optimal solution for the HFS instance.

    An optimal solution for the 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. …”
    Save to List
    Saved in:
  4. 4
    Fine-Tuning a Genetic Algorithm for CAMD: A Screening-Guided Warm Start

    Fine-Tuning a Genetic Algorithm for CAMD: A Screening-Guided Warm Start by Yifan Wang (380120)

    Published 2025
    “…In response to these challenges, this work presents a method to fine-tune a genetic algorithm for CAMD. The proposed method builds on the COSMO-CAMD framework that utilizes a genetic algorithm for solving optimization-based molecular design problems and COSMO-RS for predicting physical properties of molecules. …”
    Save to List
    Saved in:
  5. 5
    Fine-Tuning a Genetic Algorithm for CAMD: A Screening-Guided Warm Start

    Fine-Tuning a Genetic Algorithm for CAMD: A Screening-Guided Warm Start by Yifan Wang (380120)

    Published 2025
    “…In response to these challenges, this work presents a method to fine-tune a genetic algorithm for CAMD. The proposed method builds on the COSMO-CAMD framework that utilizes a genetic algorithm for solving optimization-based molecular design problems and COSMO-RS for predicting physical properties of molecules. …”
    Save to List
    Saved in:
  6. 6
    Comparison based on hard instances from [79].

    Comparison based on hard instances from [79]. 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. …”
    Save to List
    Saved in:
  7. 7
    A simple HFS instance.

    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. …”
    Save to List
    Saved in:
  8. 8
    The scheduling Gantt chart.

    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. …”
    Save to List
    Saved in:
  9. 9
    Structure and computational framework of IPMMPO.

    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. …”
    Save to List
    Saved in:
  10. 10
    Data types contained in and .

    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. …”
    Save to List
    Saved in:
  11. 11
    Data construction of the first and last rows in .

    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. …”
    Save to List
    Saved in:
  12. 12
    Schematic diagram of PM model.

    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. …”
    Save to List
    Saved in:
  13. 13
    Schematic diagram of the atomic function .

    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. …”
    Save to List
    Saved in:
  14. 14
    Multiple comparison of means - Tukey HSD.

    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. …”
    Save to List
    Saved in:
  15. 15
    Schematic diagram of the cut-and-mark operation.

    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. …”
    Save to List
    Saved in:
  16. 16
    Layout of hybrid flow shop scheduling.

    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. …”
    Save to List
    Saved in:
  17. 17
    Probe combines and as a 2-aggregation.

    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. …”
    Save to List
    Saved in:
  18. 18
    Scheduling Gantt chart for instance j10c10c6.

    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. …”
    Save to List
    Saved in:
  19. 19
    Scheduling Gantt chart for instance j30c5e10.

    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. …”
    Save to List
    Saved in:
  20. 20
    Box plot comparison on instance j30c5e10.

    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. …”
    Save to List
    Saved in:

Search Tools: