Sciweavers

3154 search results - page 353 / 631
» Computing Closed Skycubes
Sort
View
SPAA
2003
ACM
15 years 12 months ago
Online oblivious routing
We consider an online version of the oblivious routing problem. Oblivious routing is the problem of picking a routing between each pair of nodes (or a set of ows), without knowled...
Nikhil Bansal, Avrim Blum, Shuchi Chawla, Adam Mey...
SPAA
2003
ACM
15 years 12 months ago
Cycle stealing under immediate dispatch task assignment
We consider the practical problem of task assignment in a server farm, where each arriving job is immediately dispatched to a server in the farm. We look at the benefit of cycle ...
Mor Harchol-Balter, Cuihong Li, Takayuki Osogami, ...
FCT
2003
Springer
15 years 12 months ago
On Exact and Approximation Algorithms for Distinguishing Substring Selection
Abstract. The NP-complete Distinguishing Substring Selection problem (DSSS for short) asks, given a set of “good” strings and a set of “bad” strings, for a solution string ...
Jens Gramm, Jiong Guo, Rolf Niedermeier
AP2PS
2009
IEEE
15 years 11 months ago
A Highly Robust P2P-CDN under Large-Scale and Dynamic Participation
—By building a P2P Content Distribution Network (CDN), peers collaborate to distribute the content of underprovisionned websites and to serve queries for larger audiences on beha...
Manal El Dick, Esther Pacitti, Bettina Kemme
DANCE
2002
IEEE
15 years 11 months ago
Experiences with Capsule-Based Active Networking
Active Networking adds programmability to the elements of the network, most aggressively by using programmable packets, or capsules. ANTS [1, 2] and PLANet [3, 4] are the most mat...
Michael W. Hicks, Jonathan T. Moore, David Wethera...