Home
Files
Tags
Requests
Topics
About
Top
Frequently Asked Questions (FAQ)
Entire website search
In category
Everywhere but category
Search
Email
Password
Login
Sign up
Forgot password?
FAQ: Login
Login via:
vk.com
ok.ru
google.com
mail.ru
yandex.ru
Files
Applied materials
Computing
Computer networks
Xu J., Lipton R. On Fundamental Tradeoffs Between Delay Bounds and Computational Complexity in Packet Scheduling Algorithms
pdf
file
size 579,97 KB
added by
CAnatolka
01/05/2011 03:32
info modified
04/14/2011 20:11
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 13, NO. 1, FEBRUARY 2005.
Computational complexity, decision tree, delay bound, packet scheduling, quality of service.
Sign up or login using form at top of the page to download this file.
Sign up
Home
Up