| Virual Oral Presentation Slide by Slide |
IEEE/ICACT20230136 Slide.14
[Big Slide]
| Oral Presentation |
|
|
Fig. shows the total network cost of greedy algorithm and PSO algorithm in the same simulation environment. It can be seen that the cost of the greedy algorithm is always lower than that of PSO algorithm. As the number of input inference tasks increases, the cost difference between the two algorithms decreases and the cost of PSO algorithm tends to the cost of greedy algorithm. | |
| [Go to Next Slide] |