Help with Algorithm to Code conversion
信息
此问题已关闭。 请重新打开它进行编辑或回答。
显示 更早的评论
For more info about the alorithm Page 9 of this "Energy Consumption Minimization for Near-Far Server Cooperation in NOMA-Assisted Mobile Edge Computing System" paper
1: Initialize a group of feasible values {d(0), p(0), t(0), T, D},
tolerant thresholds
"1, "2;
2: Solve problem (P1.a) to obtain the optimal fn∗, Eloc ∗ , tloc ∗
3: Initialize outer iterative index j D 1;
4: Repeat
5: Initialize inner iterative index m D 1, Taylor expansion
point
pm 1 ;
STEP 1: Repeat 1
With fixed task partition d(j) and time assignment
t(j), solve problem (P2.a) to obtain the optimal power
allocation
p(m), p∗ 2(m), p∗ 3(m);
6:
7: ∗ 18: pm 1 C1 D p∗ 1(m);
9: Set m D m C 1;
10: End Repeat 1 until jpm 1 C1 - pm 1 j ≤ "2;
11:
12: p(jC1) D p∗(m);
STEP 2: With fixed power allocation p(jC1),
solve problem (P2.c) to obtain the optimal task
partition
d(jC1), time assignment t(jC1);
Set
j D j C 1;
13: 14: End Repeat until jE(jC1) - E(j)j ≤ "1;
15: Output the optimal solution d∗, t∗, p∗, fn∗
1 个评论
Walter Roberson
2022-7-30
What do you have so far? What are your particular questions?
We are not likely to write the code for you, but if you have particular questions we will assist you with those.
回答（0 个）
此问题已关闭。
2022-7-30
关闭：
2022-7-30
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Translated by 
