Search alternatives:
process optimization » model optimization (Expand Search)
codon optimization » wolf optimization (Expand Search)
time process » like process (Expand Search), time processing (Expand Search), entire process (Expand Search)
binary time » binary image (Expand Search)
based codon » based color (Expand Search), based cohort (Expand Search), based action (Expand Search)
less based » lens based (Expand Search), lemos based (Expand Search), degs based (Expand Search)
process optimization » model optimization (Expand Search)
codon optimization » wolf optimization (Expand Search)
time process » like process (Expand Search), time processing (Expand Search), entire process (Expand Search)
binary time » binary image (Expand Search)
based codon » based color (Expand Search), based cohort (Expand Search), based action (Expand Search)
less based » lens based (Expand Search), lemos based (Expand Search), degs based (Expand Search)
-
21
CDF of task latency, approximated as the inverse of the achieved computation rate.
Published 2025Subjects: -
22
-
23
A* Path-Finding Algorithm to Determine Cell Connections
Published 2025“…Pixel paths were classified using a z-score brightness threshold of 1.21, optimized for noise reduction and accuracy. The A* algorithm then evaluated connectivity by minimizing Euclidean distance and heuristic cost between cells. …”
-
24
-
25
Dynamic resource allocation process.
Published 2025“…Subsequently, we implement an optimal binary tree decision-making algorithm, grounded in dynamic programming, to achieve precise allocation of elastic resources within data streams, significantly bolstering resource utilization. …”
-
26
Event-driven data flow processing.
Published 2025“…Subsequently, we implement an optimal binary tree decision-making algorithm, grounded in dynamic programming, to achieve precise allocation of elastic resources within data streams, significantly bolstering resource utilization. …”
-
27
-
28
Summary of literature review.
Published 2024“…To overcome this limitation, recent advancements have introduced multi-objective evolutionary algorithms for ATS. This study proposes an enhancement to the performance of ATS through the utilization of an improved version of the Binary Multi-Objective Grey Wolf Optimizer (BMOGWO), incorporating mutation. …”
-
29
Topic description.
Published 2024“…To overcome this limitation, recent advancements have introduced multi-objective evolutionary algorithms for ATS. This study proposes an enhancement to the performance of ATS through the utilization of an improved version of the Binary Multi-Objective Grey Wolf Optimizer (BMOGWO), incorporating mutation. …”
-
30
Notations along with their descriptions.
Published 2024“…To overcome this limitation, recent advancements have introduced multi-objective evolutionary algorithms for ATS. This study proposes an enhancement to the performance of ATS through the utilization of an improved version of the Binary Multi-Objective Grey Wolf Optimizer (BMOGWO), incorporating mutation. …”
-
31
Detail of the topics extracted from DUC2002.
Published 2024“…To overcome this limitation, recent advancements have introduced multi-objective evolutionary algorithms for ATS. This study proposes an enhancement to the performance of ATS through the utilization of an improved version of the Binary Multi-Objective Grey Wolf Optimizer (BMOGWO), incorporating mutation. …”
-
32
Improved support vector machine classification algorithm based on adaptive feature weight updating in the Hadoop cluster environment
Published 2019“…When the number of images reaches 80,000, the training time of the proposed algorithm is only 1/5 that of traditional single-node architecture algorithms. …”
-
33
-
34
-
35
-
36
Table_1_bSRWPSO-FKNN: A boosted PSO with fuzzy K-nearest neighbor classifier for predicting atopic dermatitis disease.docx
Published 2023“…</p>Methods<p>This paper establishes a medical prediction model for the first time on the basis of the enhanced particle swarm optimization (SRWPSO) algorithm and the fuzzy K-nearest neighbor (FKNN), called bSRWPSO-FKNN, which is practiced on a dataset related to patients with AD. …”
-
37
Confusion matrix.
Published 2025“…Subsequently, we implement an optimal binary tree decision-making algorithm, grounded in dynamic programming, to achieve precise allocation of elastic resources within data streams, significantly bolstering resource utilization. …”
-
38
Parameter settings.
Published 2025“…Subsequently, we implement an optimal binary tree decision-making algorithm, grounded in dynamic programming, to achieve precise allocation of elastic resources within data streams, significantly bolstering resource utilization. …”
-
39
Table_1_Near infrared spectroscopy for cooking time classification of cassava genotypes.docx
Published 2024“…The accuracy of the optimal scenario for classifying samples with a cooking time of 30 minutes reached RCal2 = 0.86 and RVal2 = 0.84, with a Kappa value of 0.53. …”
-
40
Contextual Dynamic Pricing with Strategic Buyers
Published 2024“…This underscores the rate optimality of our policy. Importantly, our policy is not a mere amalgamation of existing dynamic pricing policies and strategic behavior handling algorithms. …”