Search alternatives:
common optimization » codon optimization (Expand Search), carbon optimization (Expand Search), cosmic optimization (Expand Search)
work optimization » wolf optimization (Expand Search), swarm optimization (Expand Search), dose optimization (Expand Search)
library based » laboratory based (Expand Search)
based work » based network (Expand Search)
binary a » binary _ (Expand Search), binary b (Expand Search), hilary a (Expand Search)
a common » _ common (Expand Search)
Showing 1 - 20 results of 69 for search '(( library based work optimization algorithm ) OR ( binary a common optimization algorithm ))', query time: 0.60s Refine Results
  1. 1
    An optimal solution for the HFS instance.

    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. This work firstly proposes an Improved Probe Machine with Multi-Level Probe Operations (IPMMPO) and ingeniously designs general data libraries and probe libraries tailored for multi-scenario HFS problems, including HFS with identical parallel machines and HFS with unrelated parallel machines, no-wait scenario, and standard scenario. …”
    Save to List
    Saved in:
  2. 2
    Binary contingency table.

    Binary contingency table. by Lu Xiao (314030)

    Published 2024
    Save to List
    Saved in:
  3. 3
    Comparison based on hard instances from [79].

    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. This work firstly proposes an Improved Probe Machine with Multi-Level Probe Operations (IPMMPO) and ingeniously designs general data libraries and probe libraries tailored for multi-scenario HFS problems, including HFS with identical parallel machines and HFS with unrelated parallel machines, no-wait scenario, and standard scenario. …”
    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
    “…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
    “…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
    Python-Based Algorithm for Estimating NRTL Model Parameters with UNIFAC Model Simulation Results

    Python-Based Algorithm for Estimating NRTL Model Parameters with UNIFAC Model Simulation Results by Se-Hee Jo (20554623)

    Published 2025
    “…A Python-based algorithm was developed for estimating the nonrandom two-liquid (NRTL) model parameters of aqueous binary systems in a straightforward manner from simplified molecular-input line-entry specification (SMILES) strings of substances in a system. …”
    Save to List
    Saved in:
  7. 7
    Presentation_1_Calibrating Seed-Based Heuristics to Map Short Reads With Sesame.zip

    Presentation_1_Calibrating Seed-Based Heuristics to Map Short Reads With Sesame.zip by Guillaume J. Filion (9027317)

    Published 2020
    Save to List
    Saved in:
  8. 8
    A simple HFS instance.

    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. This work firstly proposes an Improved Probe Machine with Multi-Level Probe Operations (IPMMPO) and ingeniously designs general data libraries and probe libraries tailored for multi-scenario HFS problems, including HFS with identical parallel machines and HFS with unrelated parallel machines, no-wait scenario, and standard scenario. …”
    Save to List
    Saved in:
  9. 9
    The scheduling Gantt chart.

    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. This work firstly proposes an Improved Probe Machine with Multi-Level Probe Operations (IPMMPO) and ingeniously designs general data libraries and probe libraries tailored for multi-scenario HFS problems, including HFS with identical parallel machines and HFS with unrelated parallel machines, no-wait scenario, and standard scenario. …”
    Save to List
    Saved in:
  10. 10
    Structure and computational framework of IPMMPO.

    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. This work firstly proposes an Improved Probe Machine with Multi-Level Probe Operations (IPMMPO) and ingeniously designs general data libraries and probe libraries tailored for multi-scenario HFS problems, including HFS with identical parallel machines and HFS with unrelated parallel machines, no-wait scenario, and standard scenario. …”
    Save to List
    Saved in:
  11. 11
    Data types contained in and .

    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. This work firstly proposes an Improved Probe Machine with Multi-Level Probe Operations (IPMMPO) and ingeniously designs general data libraries and probe libraries tailored for multi-scenario HFS problems, including HFS with identical parallel machines and HFS with unrelated parallel machines, no-wait scenario, and standard scenario. …”
    Save to List
    Saved in:
  12. 12
    Data construction of the first and last rows in .

    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. This work firstly proposes an Improved Probe Machine with Multi-Level Probe Operations (IPMMPO) and ingeniously designs general data libraries and probe libraries tailored for multi-scenario HFS problems, including HFS with identical parallel machines and HFS with unrelated parallel machines, no-wait scenario, and standard scenario. …”
    Save to List
    Saved in:
  13. 13
    Schematic diagram of PM model.

    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. This work firstly proposes an Improved Probe Machine with Multi-Level Probe Operations (IPMMPO) and ingeniously designs general data libraries and probe libraries tailored for multi-scenario HFS problems, including HFS with identical parallel machines and HFS with unrelated parallel machines, no-wait scenario, and standard scenario. …”
    Save to List
    Saved in:
  14. 14
    Schematic diagram of the atomic function .

    Schematic diagram of the atomic function . 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. This work firstly proposes an Improved Probe Machine with Multi-Level Probe Operations (IPMMPO) and ingeniously designs general data libraries and probe libraries tailored for multi-scenario HFS problems, including HFS with identical parallel machines and HFS with unrelated parallel machines, no-wait scenario, and standard scenario. …”
    Save to List
    Saved in:
  15. 15
    Multiple comparison of means - Tukey HSD.

    Multiple comparison of means - Tukey HSD. 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. This work firstly proposes an Improved Probe Machine with Multi-Level Probe Operations (IPMMPO) and ingeniously designs general data libraries and probe libraries tailored for multi-scenario HFS problems, including HFS with identical parallel machines and HFS with unrelated parallel machines, no-wait scenario, and standard scenario. …”
    Save to List
    Saved in:
  16. 16
    Schematic diagram of the cut-and-mark operation.

    Schematic diagram of the cut-and-mark operation. 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. This work firstly proposes an Improved Probe Machine with Multi-Level Probe Operations (IPMMPO) and ingeniously designs general data libraries and probe libraries tailored for multi-scenario HFS problems, including HFS with identical parallel machines and HFS with unrelated parallel machines, no-wait scenario, and standard scenario. …”
    Save to List
    Saved in:
  17. 17
    Layout of hybrid flow shop scheduling.

    Layout of hybrid flow shop scheduling. 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. This work firstly proposes an Improved Probe Machine with Multi-Level Probe Operations (IPMMPO) and ingeniously designs general data libraries and probe libraries tailored for multi-scenario HFS problems, including HFS with identical parallel machines and HFS with unrelated parallel machines, no-wait scenario, and standard scenario. …”
    Save to List
    Saved in:
  18. 18
    Probe combines and as a 2-aggregation.

    Probe combines and as a 2-aggregation. 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. This work firstly proposes an Improved Probe Machine with Multi-Level Probe Operations (IPMMPO) and ingeniously designs general data libraries and probe libraries tailored for multi-scenario HFS problems, including HFS with identical parallel machines and HFS with unrelated parallel machines, no-wait scenario, and standard scenario. …”
    Save to List
    Saved in:
  19. 19
    Scheduling Gantt chart for instance j10c10c6.

    Scheduling Gantt chart for instance j10c10c6. 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. This work firstly proposes an Improved Probe Machine with Multi-Level Probe Operations (IPMMPO) and ingeniously designs general data libraries and probe libraries tailored for multi-scenario HFS problems, including HFS with identical parallel machines and HFS with unrelated parallel machines, no-wait scenario, and standard scenario. …”
    Save to List
    Saved in:
  20. 20
    Scheduling Gantt chart for instance j30c5e10.

    Scheduling Gantt chart for instance j30c5e10. 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. This work firstly proposes an Improved Probe Machine with Multi-Level Probe Operations (IPMMPO) and ingeniously designs general data libraries and probe libraries tailored for multi-scenario HFS problems, including HFS with identical parallel machines and HFS with unrelated parallel machines, no-wait scenario, and standard scenario. …”
    Save to List
    Saved in:

Search Tools: