IEEE/ICACT20230164 Slide.16        [Big Slide]       Oral Presentation
The complexity of the proposed user grouping algorithm based on matching search is lower than that of the user grouping algorithm based on exhaustive search.

[Go to Next Slide]
Select Voice: