Table - PMC

Skip to main content

View full-text article in PMC

. 2021 May 13;21(10):3411. doi: 10.3390/s21103411

Algorithm 1: CGA: c-set generation algorithm

1:
procedureCGA
2:
$C : = d e f i n e_i n i t i a l_f e a s i b l e_c S e t s_l i s t ()$ ;
3:
$n e w_c S e t_g e n e r a t e d : = t r u e$ ;
4:
while ( $n e w_c S e t_g e n e r a t e d = t r u e$ ) do
5:
$λ^{*} : = s o l v e_D M P (C)$ ;
6:
$c^{*} : = s o l v e_P P (λ^{*})$ ;
7:
if $P (c^{*}, λ^{*}) > 0$ then
8:
$C : = C \cup {c^{*}}$ ;
9:
else
10:
$n e w_c S e t_g e n e r a t e d : = f a l s e$ ;
11:
end if
12:
end while
13:
end procedure