Search alternatives:
robust optimization » process optimization (Expand Search), robust estimation (Expand Search), joint optimization (Expand Search)
model optimization » codon optimization (Expand Search), global optimization (Expand Search), based optimization (Expand Search)
library based » laboratory based (Expand Search)
based robust » based probes (Expand Search)
binary may » binary mask (Expand Search), binary image (Expand Search)
may model » many model (Expand Search), way model (Expand Search), clay model (Expand Search)
robust optimization » process optimization (Expand Search), robust estimation (Expand Search), joint optimization (Expand Search)
model optimization » codon optimization (Expand Search), global optimization (Expand Search), based optimization (Expand Search)
library based » laboratory based (Expand Search)
based robust » based probes (Expand Search)
binary may » binary mask (Expand Search), binary image (Expand Search)
may model » many model (Expand Search), way model (Expand Search), clay model (Expand Search)
-
1
-
2
-
3
-
4
-
5
-
6
-
7
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. …”
-
8
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. …”
-
9
IRBMO vs. feature selection algorithm 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. …”
-
10
-
11
-
12
Data_Sheet_1_CLGBO: An Algorithm for Constructing Highly Robust Coding Sets for DNA Storage.docx
Published 2021“…In this study, we describe an enhanced gradient-based optimizer that includes the Cauchy and Levy mutation strategy (CLGBO) to construct DNA coding sets, which are used as primer and address libraries. …”
-
13
Fine-Tuning a Genetic Algorithm for CAMD: A Screening-Guided Warm Start
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
Fine-Tuning a Genetic Algorithm for CAMD: A Screening-Guided Warm Start
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
-
16
-
17
-
18
Pseudo Code of RBMO.
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. …”
-
19
P-value on CEC-2017(Dim = 30).
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
Memory storage behavior.
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. …”