Search alternatives:
scale optimization » whale optimization (Expand Search), swarm optimization (Expand Search), phase optimization (Expand Search)
based optimization » whale optimization (Expand Search)
binary 2 » binary _ (Expand Search), binary b (Expand Search)
2 based » _ based (Expand Search), 1 based (Expand Search), ai based (Expand Search)
scale optimization » whale optimization (Expand Search), swarm optimization (Expand Search), phase optimization (Expand Search)
based optimization » whale optimization (Expand Search)
binary 2 » binary _ (Expand Search), binary b (Expand Search)
2 based » _ based (Expand Search), 1 based (Expand Search), ai based (Expand Search)
-
41
-
42
-
43
Quadratic polynomial in 2D image plane.
Published 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. …”
-
44
-
45
Data_Sheet_1_A Global Optimizer for Nanoclusters.PDF
Published 2019“…This method is implemented in PyAR (https://github.com/anooplab/pyar) program. The global optimization in PyAR involves two parts, generation of several trial geometries and gradient-based local optimization of the trial geometries. …”
-
46
-
47
-
48
-
49
-
50
-
51
-
52
-
53
-
54
-
55
Multicategory Angle-Based Learning for Estimating Optimal Dynamic Treatment Regimes With Censored Data
Published 2021“…In this article, we develop a novel angle-based approach to search the optimal DTR under a multicategory treatment framework for survival data. …”
-
56
-
57
-
58
-
59
Sample image for illustration.
Published 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. …”
-
60
Steps in the extraction of 14 coordinates from the CT slices for the curved MPR.
Published 2025“…Protruding paths are then eliminated using graph-based optimization algorithms, as demonstrated in f). …”