Table 2 Computational complexity analysis
Algorithms | General case | M = 64, N = 16, U = 50, k = 10 |
|---|---|---|
ES-based JASUS | \( \mathrm{O}\left({\mathrm{C}}_M^N{\mathrm{C}}_U^K{\mathrm{N}}^3\right) \) | 2.1 × 1028 |
AMCMC-based JASUS | O(N3tLMCMC) | 2.8 × 107 |
Greedy-based JASUS | tO(MUN3) | 3.9 × 108 |
Norm-based JASUS | O(MU) + tO(N3) | 1.3 × 105 |
Number of iterations t | 1 ≤ t ≤ 50 | t = 30 |
Constant δ | 0.5/1/1.5/2/2.5 | δ = 2 |
Number of promising samples LMCMC | LMCMC = δ × (M + U) | LMCMC = 228 |