بدائل البحث:
task optimization » based optimization (توسيع البحث), phase optimization (توسيع البحث), path optimization (توسيع البحث)
work optimization » wolf optimization (توسيع البحث), swarm optimization (توسيع البحث), dose optimization (توسيع البحث)
binary based » library based (توسيع البحث), linac based (توسيع البحث), binary mask (توسيع البحث)
image task » imagery tasks (توسيع البحث)
based work » based network (توسيع البحث)
task optimization » based optimization (توسيع البحث), phase optimization (توسيع البحث), path optimization (توسيع البحث)
work optimization » wolf optimization (توسيع البحث), swarm optimization (توسيع البحث), dose optimization (توسيع البحث)
binary based » library based (توسيع البحث), linac based (توسيع البحث), binary mask (توسيع البحث)
image task » imagery tasks (توسيع البحث)
based work » based network (توسيع البحث)
-
1
-
2
-
3
-
4
A* Path-Finding Algorithm to Determine Cell Connections
منشور في 2025"…Future work aims to generalize this algorithm for broader biological applications by training additional Cellpose models and adapting the A* framework.…"
-
5
-
6
Sample image for illustration.
منشور في 2024"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"
-
7
Quadratic polynomial in 2D image plane.
منشور في 2024"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"
-
8
-
9
Comparison analysis of computation time.
منشور في 2024"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"
-
10
Process flow diagram of CBFD.
منشور في 2024"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"
-
11
Precision recall curve.
منشور في 2024"…Furthermore, the matching score for the test image is 0.975. The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …"
-
12
Triplet Matching for Estimating Causal Effects With Three Treatment Arms: A Comparative Study of Mortality by Trauma Center Level
منشور في 2021"…Our algorithm outperforms the nearest neighbor algorithm and is shown to produce matched samples with total distance no larger than twice the optimal distance. …"
-
13
-
14
-
15
Analysis and design of algorithms for the manufacturing process of integrated circuits
منشور في 2023"…The (approximate) solution proposals of state-of-the-art methods include rule-based approaches, genetic algorithms, and reinforcement learning. …"
-
16
-
17
-
18
-
19
Data_Sheet_1_A real-time driver fatigue identification method based on GA-GRNN.ZIP
منشور في 2022"…In this paper, a non-invasive and low-cost method of fatigue driving state identification based on genetic algorithm optimization of generalized regression neural network model is proposed. …"
-
20
DataSheet_1_Raman Spectroscopic Differentiation of Streptococcus pneumoniae From Other Streptococci Using Laboratory Strains and Clinical Isolates.pdf
منشور في 2022"…Improvement of the classification rate is expected with optimized model parameters and algorithms as well as with a larger spectral data base for training.…"