Search alternatives:
resource optimization » resource utilization (Expand Search), resource utilisation (Expand Search), resource limitations (Expand Search)
scale optimization » whale optimization (Expand Search), swarm optimization (Expand Search), phase optimization (Expand Search)
value resource » value resources (Expand Search), valuable resource (Expand Search), also resource (Expand Search)
binary value » binary values (Expand Search), boundary value (Expand Search)
resource optimization » resource utilization (Expand Search), resource utilisation (Expand Search), resource limitations (Expand Search)
scale optimization » whale optimization (Expand Search), swarm optimization (Expand Search), phase optimization (Expand Search)
value resource » value resources (Expand Search), valuable resource (Expand Search), also resource (Expand Search)
binary value » binary values (Expand Search), boundary value (Expand Search)
-
1
-
2
-
3
-
4
Supplementary file 1_Encodings of the weighted MAX k-CUT problem on qubit systems.pdf
Published 2025“…This study explores encoding methods for MAX k-CUT on qubit systems by utilizing quantum approximate optimization algorithms (QAOA) and addressing the challenge of encoding integer values on quantum devices with binary variables. …”
-
5
-
6
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. …”
-
7
-
8
-
9
-
10
Improved support vector machine classification algorithm based on adaptive feature weight updating in the Hadoop cluster environment
Published 2019“…The MapReduce parallel programming model on the Hadoop platform is used to perform an adaptive fusion of hue, local binary pattern (LBP) and scale-invariant feature transform (SIFT) features extracted from images to derive optimal combinations of weights. …”
-
11
-
12
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. …”
-
13
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. …”
-
14
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. …”
-
15
-
16
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. …”
-
17
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. …”
-
18
Steps in the extraction of 14 coordinates from the CT slices for the curved MPR.
Published 2025“…The image is then cleaned in c) using morphological filtering with an <i>opening</i> operation to remove small-scale noise. …”
-
19
-
20