Showing 1 - 20 results of 35 for search '(( library based process optimization algorithm ) OR ( binary _ codon optimization algorithm ))', query time: 0.44s Refine Results
  1. 1

    An optimal solution for the HFS instance. by Xiang Tian (4369285)

    Published 2025
    “…In recent years, due to the advantages of nonlinear access and fully parallel processing, the probe machine has shown powerful computing capabilities and promising applications in solving various combinatorial optimization problems. …”
  2. 2

    Comparison based on hard instances from [79]. by Xiang Tian (4369285)

    Published 2025
    “…In recent years, due to the advantages of nonlinear access and fully parallel processing, the probe machine has shown powerful computing capabilities and promising applications in solving various combinatorial optimization problems. …”
  3. 3
  4. 4
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10
  11. 11
  12. 12
  13. 13

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

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

    A simple HFS instance. by Xiang Tian (4369285)

    Published 2025
    “…In recent years, due to the advantages of nonlinear access and fully parallel processing, the probe machine has shown powerful computing capabilities and promising applications in solving various combinatorial optimization problems. …”
  16. 16

    The scheduling Gantt chart. by Xiang Tian (4369285)

    Published 2025
    “…In recent years, due to the advantages of nonlinear access and fully parallel processing, the probe machine has shown powerful computing capabilities and promising applications in solving various combinatorial optimization problems. …”
  17. 17

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

    Published 2025
    “…In recent years, due to the advantages of nonlinear access and fully parallel processing, the probe machine has shown powerful computing capabilities and promising applications in solving various combinatorial optimization problems. …”
  18. 18

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

    Published 2025
    “…In recent years, due to the advantages of nonlinear access and fully parallel processing, the probe machine has shown powerful computing capabilities and promising applications in solving various combinatorial optimization problems. …”
  19. 19

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

    Published 2025
    “…In recent years, due to the advantages of nonlinear access and fully parallel processing, the probe machine has shown powerful computing capabilities and promising applications in solving various combinatorial optimization problems. …”
  20. 20

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

    Published 2025
    “…In recent years, due to the advantages of nonlinear access and fully parallel processing, the probe machine has shown powerful computing capabilities and promising applications in solving various combinatorial optimization problems. …”