Algorithms

General case

M = 64, N = 16, U = 50, k = 10


ESbased JASUS

\( \mathrm{O}\left({\mathrm{C}}_M^N{\mathrm{C}}_U^K{\mathrm{N}}^3\right) \)

2.1 × 10^{28}

AMCMCbased JASUS

O(N^{3}tL_{MCMC})

2.8 × 10^{7}

Greedybased JASUS

tO(MUN^{3})

3.9 × 10^{8}

Normbased JASUS

O(MU) + tO(N^{3})

1.3 × 10^{5}

Number of iterations t

1 ≤ t ≤ 50

t = 30

Constant δ

0.5/1/1.5/2/2.5

δ = 2

Number of promising samples L_{MCMC}

L_{MCMC} = δ × (M + U)

L_{MCMC} = 228

 Notes: δ = 2 is the best value in our experiments, because when δ is larger than 2, the cell capacity performance improvement is no longer significant