Searching for "On fundamental tradeoffs between delay bounds and computational complexity in packet scheduling algorithms." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

On Fundamental Tradeoffs between Delay Bounds and Computational Complexity in Packet Scheduling
by Jun Xu, Richard J. Lipton — 2002 — in Proceedings of ACM SIGCOMM ’02
…On Fundamental Tradeoffs between Delay Bounds and Computational Complexity in Packet Scheduling…
Cited by 24 (2 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | MS Live | CSB