Search alternatives:
based optimization » whale optimization (Expand Search)
a optimization » ai optimization (Expand Search), _ optimization (Expand Search), b optimization (Expand Search)
binary task » binary mask (Expand Search)
task a » task _ (Expand Search), task 1 (Expand Search), task p (Expand Search)
based optimization » whale optimization (Expand Search)
a optimization » ai optimization (Expand Search), _ optimization (Expand Search), b optimization (Expand Search)
binary task » binary mask (Expand Search)
task a » task _ (Expand Search), task 1 (Expand Search), task p (Expand Search)
-
1
-
2
-
3
Proposed Algorithm.
Published 2025“…This paper considers a wireless-powered MEC network employing a binary offloading policy, in which the computation tasks of MDs are either executed locally or fully offloaded to an edge server (ES). …”
-
4
Comparisons between ADAM and NADAM optimizers.
Published 2025“…This paper considers a wireless-powered MEC network employing a binary offloading policy, in which the computation tasks of MDs are either executed locally or fully offloaded to an edge server (ES). …”
-
5
ROC curve for binary classification.
Published 2024“…The study introduced a scheme for enhancing images to improve the quality of the datasets. Specifically, an image enhancement algorithm based on histogram equalization and bilateral filtering techniques was deployed to reduce noise and enhance the quality of the images. …”
-
6
Confusion matrix for binary classification.
Published 2024“…The study introduced a scheme for enhancing images to improve the quality of the datasets. Specifically, an image enhancement algorithm based on histogram equalization and bilateral filtering techniques was deployed to reduce noise and enhance the quality of the images. …”
-
7
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. …”
-
8
-
9
Flowchart scheme of the ML-based model.
Published 2024“…<b>I)</b> Testing data consisting of 20% of the entire dataset. <b>J)</b> Optimization of hyperparameter tuning. <b>K)</b> Algorithm selection from all models. …”
-
10
-
11
The Pseudo-Code of the IRBMO Algorithm.
Published 2025“…In order to comprehensively verify the performance of IRBMO, this paper designs a series of experiments to compare it with nine mainstream binary optimization algorithms. …”
-
12
IRBMO vs. meta-heuristic algorithms boxplot.
Published 2025“…In order to comprehensively verify the performance of IRBMO, this paper designs a series of experiments to compare it with nine mainstream binary optimization algorithms. …”
-
13
IRBMO vs. feature selection algorithm boxplot.
Published 2025“…In order to comprehensively verify the performance of IRBMO, this paper designs a series of experiments to compare it with nine mainstream binary optimization algorithms. …”
-
14
An Example of a WPT-MEC Network.
Published 2025“…This paper considers a wireless-powered MEC network employing a binary offloading policy, in which the computation tasks of MDs are either executed locally or fully offloaded to an edge server (ES). …”
-
15
Dataset 1: Zip file containing the figures of the presented methods and results in jpeg files
Published 2025“…<p dir="ltr">Figures represented here illustrates the <b>metaheuristic-based band selection framework</b> for hyperspectral image classification using <b>Binary Jaya Algorithm enhanced with a mutation operator</b> to improve population diversity and avoid premature convergence. …”
-
16
-
17
A new fast filtering algorithm for a 3D point cloud based on RGB-D information
Published 2019“…Then, the optimal segmentation threshold of the V image that is calculated by using the Otsu algorithm is applied to segment the color mapping image into a binary image, which is used to extract the valid point cloud from the original point cloud with outliers. …”
-
18
Sample image for illustration.
Published 2024“…The results demonstrate that CBFD achieves a average precision of 0.97 for the test image, outperforming Superpoint, Directional Intensified Tertiary Filtering (DITF), Binary Robust Independent Elementary Features (BRIEF), Binary Robust Invariant Scalable Keypoints (BRISK), Speeded Up Robust Features (SURF), and Scale Invariant Feature Transform (SIFT), which achieve scores of 0.95, 0.92, 0.72, 0.66, 0.63 and 0.50 respectively. …”
-
19
Improved support vector machine classification algorithm based on adaptive feature weight updating in the Hadoop cluster environment
Published 2019“…<div><p>An image classification algorithm based on adaptive feature weight updating is proposed to address the low classification accuracy of the current single-feature classification algorithms and simple multifeature fusion algorithms. …”
-
20
Quadratic polynomial in 2D image plane.
Published 2024“…The results demonstrate that CBFD achieves a average precision of 0.97 for the test image, outperforming Superpoint, Directional Intensified Tertiary Filtering (DITF), Binary Robust Independent Elementary Features (BRIEF), Binary Robust Invariant Scalable Keypoints (BRISK), Speeded Up Robust Features (SURF), and Scale Invariant Feature Transform (SIFT), which achieve scores of 0.95, 0.92, 0.72, 0.66, 0.63 and 0.50 respectively. …”