This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
—Optimal scheduling for concurrent transmissions in rate-nonadaptive wireless networks is NP-hard. Optimal scheduling in rate-adaptive wireless networks is even more difficult, ...
It is well known that the maximum weighted independent set (MWIS) problem is NP-complete. Moreover, optimal scheduling in wireless networks requires solving a MWIS problem. Conseq...
We describe a scheduling technique in which estimated job runtimes and estimated resource availability are used to efficiently distribute workloads across a homogeneous grid of res...
Sam Verboven, Peter Hellinckx, Jan Broeckhove, Fra...