Search alternatives:
improve optimization » iterative optimization (Expand Search), model optimization (Expand Search), process optimization (Expand Search)
codon optimization » wolf optimization (Expand Search)
library based » laboratory based (Expand Search)
binary base » binary mask (Expand Search), ciliary base (Expand Search), binary image (Expand Search)
improve optimization » iterative optimization (Expand Search), model optimization (Expand Search), process optimization (Expand Search)
codon optimization » wolf optimization (Expand Search)
library based » laboratory based (Expand Search)
binary base » binary mask (Expand Search), ciliary base (Expand Search), binary image (Expand Search)
-
1
-
2
An optimal solution for the HFS instance.
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. …”
-
3
A Practical Algorithm to Solve the Near-Congruence Problem for Rigid Molecules and Clusters
Published 2023“…We present an improved algorithm to solve the near-congruence problem for rigid molecules and clusters based on the iterative application of assignment and alignment steps with biased Euclidean costs. …”
-
4
-
5
-
6
RosettaAMRLD: A Reaction-Driven Approach for Structure-Based Drug Design from Combinatorial Libraries with Monte Carlo Metropolis Algorithms
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. …”
-
7
-
8
Comparison based on hard instances from [79].
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. …”
-
9
-
10
-
11
-
12
-
13
-
14
-
15
-
16
-
17
-
18
-
19
-
20