بدائل البحث:
proteins optimization » process optimization (توسيع البحث), routing optimization (توسيع البحث), property optimization (توسيع البحث)
scale optimization » whale optimization (توسيع البحث), swarm optimization (توسيع البحث), phase optimization (توسيع البحث)
i proteins » _ proteins (توسيع البحث), 2 proteins (توسيع البحث), i protein (توسيع البحث)
binary i » binary _ (توسيع البحث)
proteins optimization » process optimization (توسيع البحث), routing optimization (توسيع البحث), property optimization (توسيع البحث)
scale optimization » whale optimization (توسيع البحث), swarm optimization (توسيع البحث), phase optimization (توسيع البحث)
i proteins » _ proteins (توسيع البحث), 2 proteins (توسيع البحث), i protein (توسيع البحث)
binary i » binary _ (توسيع البحث)
-
1
-
2
-
3
Image1_Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm.JPEG
منشور في 2022"…This study proposes an alternative approach by implementing bipartite graph search optimization using the branch and bound algorithm to discover the combination or composition of Jamu formulas by optimizing the search on a plant–protein bipartite graph. …"
-
4
DataSheet1_Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm.docx
منشور في 2022"…This study proposes an alternative approach by implementing bipartite graph search optimization using the branch and bound algorithm to discover the combination or composition of Jamu formulas by optimizing the search on a plant–protein bipartite graph. …"
-
5
-
6
-
7
-
8
Image2_Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm.JPEG
منشور في 2022"…This study proposes an alternative approach by implementing bipartite graph search optimization using the branch and bound algorithm to discover the combination or composition of Jamu formulas by optimizing the search on a plant–protein bipartite graph. …"
-
9
Image4_Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm.jpg
منشور في 2022"…This study proposes an alternative approach by implementing bipartite graph search optimization using the branch and bound algorithm to discover the combination or composition of Jamu formulas by optimizing the search on a plant–protein bipartite graph. …"
-
10
Image5_Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm.jpg
منشور في 2022"…This study proposes an alternative approach by implementing bipartite graph search optimization using the branch and bound algorithm to discover the combination or composition of Jamu formulas by optimizing the search on a plant–protein bipartite graph. …"
-
11
Image3_Bipartite graph search optimization for type II diabetes mellitus Jamu formulation using branch and bound algorithm.JPEG
منشور في 2022"…This study proposes an alternative approach by implementing bipartite graph search optimization using the branch and bound algorithm to discover the combination or composition of Jamu formulas by optimizing the search on a plant–protein bipartite graph. …"
-
12
-
13
-
14
Improved support vector machine classification algorithm based on adaptive feature weight updating in the Hadoop cluster environment
منشور في 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. …"
-
15
-
16
-
17
Sample image for illustration.
منشور في 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
Quadratic polynomial in 2D image plane.
منشور في 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
Steps in the extraction of 14 coordinates from the CT slices for the curved MPR.
منشور في 2025"…The image is then cleaned in c) using morphological filtering with an <i>opening</i> operation to remove small-scale noise. …"
-
20