On the Possibility of Network Scheduling With Polynomial...

IEEE/ACM Transactions on Networking 2017 / 12 Vol. 25; Iss. 6

On the Possibility of Network Scheduling With Polynomial Complexity and Delay

Sharifnassab, Arsalan, Golestani, S. Jamaloddin
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
25
Language:
english
Journal:
IEEE/ACM Transactions on Networking
DOI:
10.1109/TNET.2017.2761191
Date:
December, 2017
File:
PDF, 752 KB
english, 2017
Conversion to is in progress
Conversion to is failed