1127 search results - page 161 / 226 » Theory Extension in ACL2(r) |
177
click to vote
FOCS
2009
IEEE
16 years 28 days ago
2009
IEEE
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
170
click to vote
IEEEPACT
2009
IEEE
16 years 25 days ago
2009
IEEE
In today’s data centers, precisely controlling server power consumption is an essential way to avoid system failures caused by power capacity overload or overheating due to incr...
179
click to vote
INFOCOM
2009
IEEE
16 years 25 days ago
2009
IEEE
—Network coding is a method that promises to achieve the min-cut capacity in multicasts. However, pushing towards this gain in throughput comes with two sacrifices. Delay suffer...
173
click to vote
INFOCOM
2009
IEEE
16 years 25 days ago
2009
IEEE
—The performance of randomized network coding can suffer significantly when malicious nodes corrupt the content of the exchanged blocks. Previous work have introduced error corr...
155
click to vote
INFOCOM
2009
IEEE
16 years 25 days ago
2009
IEEE
—Peer-assisted Video-on-Demand (VoD) systems have not only received substantial recent research attention, but also been implemented and deployed with success in large-scale real...