Search alternatives:
based optimization » whale optimization (Expand Search)
path optimization » swarm optimization (Expand Search), whale optimization (Expand Search), _ optimization (Expand Search)
class path » class data (Expand Search)
binary ms » binary mask (Expand Search), binary _ (Expand Search), binary b (Expand Search)
based optimization » whale optimization (Expand Search)
path optimization » swarm optimization (Expand Search), whale optimization (Expand Search), _ optimization (Expand Search)
class path » class data (Expand Search)
binary ms » binary mask (Expand Search), binary _ (Expand Search), binary b (Expand Search)
-
1
-
2
-
3
DataSheet1_Quantum-inspired optimization for wavelength assignment.PDF
Published 2023“…Playing a central role in modern telecommunications, this problem belongs to NP-complete class for a general case so that obtaining optimal solutions for industry-relevant cases is exponentially hard. …”
-
4
PathOlOgics_RBCs Python Scripts.zip
Published 2023“…</p><p dir="ltr">In terms of classification, a second algorithm was developed and employed to preliminary sort or group the individual cells (after excluding the overlapping cells manually) into different categories using five geometric measurements applied to the extracted contour from each binary image mask (see PathOlOgics_script_2; preliminary shape measurements). …”
-
5
Sample image for illustration.
Published 2024“…The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”
-
6
Comparison analysis of computation time.
Published 2024“…The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”
-
7
Process flow diagram of CBFD.
Published 2024“…The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”
-
8
Precision recall curve.
Published 2024“…The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”
-
9
Quadratic polynomial in 2D image plane.
Published 2024“…The computation time for CBFD is 2.8 ms, which is at least 6.7% lower than that of other algorithms. …”