Search alternatives:
process optimization » model optimization (Expand Search)
design optimization » bayesian optimization (Expand Search)
phase process » phase proteins (Expand Search), whole process (Expand Search), phase protein (Expand Search)
binary phase » binary image (Expand Search), final phase (Expand Search)
primary data » primary care (Expand Search)
process optimization » model optimization (Expand Search)
design optimization » bayesian optimization (Expand Search)
phase process » phase proteins (Expand Search), whole process (Expand Search), phase protein (Expand Search)
binary phase » binary image (Expand Search), final phase (Expand Search)
primary data » primary care (Expand Search)
-
61
-
62
-
63
Table_1_One-Time Optimization of Advanced T Cell Culture Media Using a Machine Learning Pipeline.DOCX
Published 2021“…<p>The growing application of cell and gene therapies in humans leads to a need for cell type-optimized culture media. Design of Experiments (DoE) is a successful and well known tool for the development and optimization of cell culture media for bioprocessing. …”
-
64
Wilcoxon’s rank sum test results.
Published 2023“…The primary objective of MSHHOTSA is to address the limitations of the tunicate swarm algorithm, which include slow optimization speed, low accuracy, and premature convergence when dealing with complex problems. …”
-
65
Flowchart of MSHHOTSA.
Published 2023“…The primary objective of MSHHOTSA is to address the limitations of the tunicate swarm algorithm, which include slow optimization speed, low accuracy, and premature convergence when dealing with complex problems. …”
-
66
Flowchart of TSA [43].
Published 2023“…The primary objective of MSHHOTSA is to address the limitations of the tunicate swarm algorithm, which include slow optimization speed, low accuracy, and premature convergence when dealing with complex problems. …”
-
67
The proportion integral derivative controller.
Published 2023“…The primary objective of MSHHOTSA is to address the limitations of the tunicate swarm algorithm, which include slow optimization speed, low accuracy, and premature convergence when dealing with complex problems. …”
-
68
Random parameter factor.
Published 2023“…The primary objective of MSHHOTSA is to address the limitations of the tunicate swarm algorithm, which include slow optimization speed, low accuracy, and premature convergence when dealing with complex problems. …”
-
69
Eight commonly used benchmark functions.
Published 2023“…The primary objective of MSHHOTSA is to address the limitations of the tunicate swarm algorithm, which include slow optimization speed, low accuracy, and premature convergence when dealing with complex problems. …”
-
70
Hyperbolic tangent row domain.
Published 2023“…The primary objective of MSHHOTSA is to address the limitations of the tunicate swarm algorithm, which include slow optimization speed, low accuracy, and premature convergence when dealing with complex problems. …”
-
71
Parameter settings.
Published 2023“…The primary objective of MSHHOTSA is to address the limitations of the tunicate swarm algorithm, which include slow optimization speed, low accuracy, and premature convergence when dealing with complex problems. …”
-
72
Nonlinear fast convergence factor.
Published 2023“…The primary objective of MSHHOTSA is to address the limitations of the tunicate swarm algorithm, which include slow optimization speed, low accuracy, and premature convergence when dealing with complex problems. …”
-
73
CEC2019 benchmark functions.
Published 2023“…The primary objective of MSHHOTSA is to address the limitations of the tunicate swarm algorithm, which include slow optimization speed, low accuracy, and premature convergence when dealing with complex problems. …”
-
74
-
75
-
76
-
77
-
78
-
79
-
80
A portfolio selection model based on the knapsack problem under uncertainty
Published 2019“…The resulted model is converted into a parametric linear programming model in which the decision maker is able to determine the optimism threshold. Finally, a discrete firefly algorithm is designed to find the near optional solutions in large dimensions. …”