MathDB3 problems
- 0 votes0 replies1 view
Convergence conjecture for average utilities under dual scheduling
Average-utility convergence conjecture. For every such and ,
- 0 votes0 replies1 view
Conjecture that the myopic policy with global state information is close to optimal
Myopic-policy conjecture. The myopic policy with GSI is close to optimal with infinite horizon.
- 0 votes0 replies0 views
GFS lower-bound conjecture for Greedy Maximal Scheduling in fading wireless networks
Let GFS denote the greedy link scheduler introduced for wireless networks with fading channels, and let GMS denote Greedy Maximal Scheduling. The performance of a scheduler is meas…