Search alternatives:
iterative optimization » objective optimization (Expand Search)
robust optimization » process optimization (Expand Search), robust estimation (Expand Search), joint optimization (Expand Search)
based iterative » based integrative (Expand Search), based generative (Expand Search), based alternatives (Expand Search)
library based » laboratory based (Expand Search)
iterative optimization » objective optimization (Expand Search)
robust optimization » process optimization (Expand Search), robust estimation (Expand Search), joint optimization (Expand Search)
based iterative » based integrative (Expand Search), based generative (Expand Search), based alternatives (Expand Search)
library based » laboratory based (Expand Search)
-
1
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. …”
-
2
-
3
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. …”
-
4
-
5
-
6
-
7
-
8
-
9
-
10
-
11
-
12
-
13
-
14
-
15
-
16
-
17
-
18
Secure MANET routing with blockchain-enhanced latent encoder coupled GANs and BEPO optimization
Published 2025“…By integrating Latent Encoder Coupled Generative Adversarial Network (LEGAN) optimized with Binary Emperor Penguin optimizer (BEPO), the scheme enhances routing efficiency and security. …”
-
19
The Pseudo-Code of the IRBMO Algorithm.
Published 2025“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”
-
20
IRBMO vs. meta-heuristic algorithms boxplot.
Published 2025“…To adapt to the feature selection problem, we convert the continuous optimization algorithm to binary form via transfer function, which further enhances the applicability of the algorithm. …”