Search alternatives:
process optimization » model optimization (Expand Search)
whale optimization » swarm optimization (Expand Search)
primary case » primary cause (Expand Search), primary care (Expand Search), primary causes (Expand Search)
case process » phase process (Expand Search), based process (Expand Search), use process (Expand Search)
binary basic » binary mask (Expand Search)
process optimization » model optimization (Expand Search)
whale optimization » swarm optimization (Expand Search)
primary case » primary cause (Expand Search), primary care (Expand Search), primary causes (Expand Search)
case process » phase process (Expand Search), based process (Expand Search), use process (Expand Search)
binary basic » binary mask (Expand Search)
-
1
Features selected by optimization algorithms.
Published 2024“…Next, we propose a hybrid chaotic sand cat optimization technique, together with the Remora Optimization Algorithm (ROA) for feature selection. …”
-
2
-
3
Hybrid feature selection algorithm of CSCO-ROA.
Published 2024“…Next, we propose a hybrid chaotic sand cat optimization technique, together with the Remora Optimization Algorithm (ROA) for feature selection. …”
-
4
-
5
Process execution halted due to deadlock.
Published 2024“…This optimization reduces the time complexity to O(n) in the best-case and O(<i>nd</i>) in the average and worst-case scenarios, compared to the O(<i>n</i><sup>2</sup><i>d</i>) complexity of the original Banker’s algorithm. …”
-
6
Time complexity of different safety algorithms.
Published 2024“…This optimization reduces the time complexity to O(n) in the best-case and O(<i>nd</i>) in the average and worst-case scenarios, compared to the O(<i>n</i><sup>2</sup><i>d</i>) complexity of the original Banker’s algorithm. …”
-
7
Models’ performance without optimization.
Published 2024“…The findings indicate that the selected deep learning algorithms were proficient in forecasting COVID-19 cases, although their efficacy varied across different models. …”
-
8
-
9
RNN performance comparison with/out optimization.
Published 2024“…The findings indicate that the selected deep learning algorithms were proficient in forecasting COVID-19 cases, although their efficacy varied across different models. …”
-
10
-
11
Performance metrics for BrC.
Published 2024“…Next, we propose a hybrid chaotic sand cat optimization technique, together with the Remora Optimization Algorithm (ROA) for feature selection. …”
-
12
Proposed CVAE model.
Published 2024“…Next, we propose a hybrid chaotic sand cat optimization technique, together with the Remora Optimization Algorithm (ROA) for feature selection. …”
-
13
Proposed methodology.
Published 2024“…Next, we propose a hybrid chaotic sand cat optimization technique, together with the Remora Optimization Algorithm (ROA) for feature selection. …”
-
14
Loss vs. Epoch.
Published 2024“…Next, we propose a hybrid chaotic sand cat optimization technique, together with the Remora Optimization Algorithm (ROA) for feature selection. …”
-
15
Sample images from the BreakHis dataset.
Published 2024“…Next, we propose a hybrid chaotic sand cat optimization technique, together with the Remora Optimization Algorithm (ROA) for feature selection. …”
-
16
Accuracy vs. Epoch.
Published 2024“…Next, we propose a hybrid chaotic sand cat optimization technique, together with the Remora Optimization Algorithm (ROA) for feature selection. …”
-
17
Segmentation results of the proposed model.
Published 2024“…Next, we propose a hybrid chaotic sand cat optimization technique, together with the Remora Optimization Algorithm (ROA) for feature selection. …”
-
18
S1 Dataset -
Published 2024“…Next, we propose a hybrid chaotic sand cat optimization technique, together with the Remora Optimization Algorithm (ROA) for feature selection. …”
-
19
CSCO’s flowchart.
Published 2024“…Next, we propose a hybrid chaotic sand cat optimization technique, together with the Remora Optimization Algorithm (ROA) for feature selection. …”
-
20
Summary of related studies.
Published 2024“…This optimization reduces the time complexity to O(n) in the best-case and O(<i>nd</i>) in the average and worst-case scenarios, compared to the O(<i>n</i><sup>2</sup><i>d</i>) complexity of the original Banker’s algorithm. …”