Search alternatives:
process optimization » model optimization (Expand Search)
from optimization » fox optimization (Expand Search), swarm optimization (Expand Search), codon optimization (Expand Search)
library based » laboratory based (Expand Search)
based process » based processes (Expand Search), based probes (Expand Search), based proteins (Expand Search)
binary 2 » binary _ (Expand Search), binary b (Expand Search)
2 from » 1 from (Expand Search)
process optimization » model optimization (Expand Search)
from optimization » fox optimization (Expand Search), swarm optimization (Expand Search), codon optimization (Expand Search)
library based » laboratory based (Expand Search)
based process » based processes (Expand Search), based probes (Expand Search), based proteins (Expand Search)
binary 2 » binary _ (Expand Search), binary b (Expand Search)
2 from » 1 from (Expand Search)
-
1
MSE for ILSTM algorithm in binary classification.
Published 2023“…The ILSTM was then used to build an efficient intrusion detection system for binary and multi-class classification cases. The proposed algorithm has two phases: phase one involves training a conventional LSTM network to get initial weights, and phase two involves using the hybrid swarm algorithms, CBOA and PSO, to optimize the weights of LSTM to improve the accuracy. …”
-
2
<i>De Novo</i> Drug Design of Targeted Chemical Libraries Based on Artificial Intelligence and Pair-Based Multiobjective Optimization
Published 2020“…In the present study, we conceived a novel pair-based multiobjective approach implemented in an adapted SMILES generative algorithm based on recurrent neural networks for the automated <i>de novo</i> design of new molecules whose overall features are optimized by finding the best trade-offs among relevant physicochemical properties (MW, logP, HBA, HBD) and additional similarity-based constraints biasing specific biological targets. …”
-
3
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. …”
-
4
-
5
Optimized Bayesian regularization-back propagation neural network using data-driven intrusion detection system in Internet of Things
Published 2025“…Hence, Binary Black Widow Optimization Algorithm (BBWOA) is proposed in this manuscript to improve the BRBPNN classifier that detects intrusion precisely. …”
-
6
A* Path-Finding Algorithm to Determine Cell Connections
Published 2025“…</p><p dir="ltr">Astrocytes were dissociated from E18 mouse cortical tissue, and image data were processed using a Cellpose 2.0 model to mask nuclei. …”
-
7
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. …”
-
8
Python-Based Algorithm for Estimating NRTL Model Parameters with UNIFAC Model Simulation Results
Published 2025“…A major challenge in bioprocess simulation is the lack of physical and chemical property databases for biochemicals. 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. …”
-
9
-
10
-
11
Image2_Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm.JPEG
Published 2022“…In this study, we specialize in applying the proposed method to search for the Jamu formula for type II diabetes mellitus (T2DM). The result shows that the bipartite graph search with the branch and bound algorithm reduces computation time up to 40 times faster than the complete search strategy to search for a composition of plants. …”
-
12
-
13
-
14
-
15
-
16
-
17
-
18
-
19
-
20