1110 search results - page 1 / 222 » New Approximation Results for Resource Replication Problems |
TCS
2010
13 years 3 months ago
2010
It is well known that the two simple algorithms for the classic bin packing problem, NF and WF both have an approximation ratio of 2. However, WF seems to be a more reasonable alg...
INFOCOM
2010
IEEE
13 years 3 months ago
2010
IEEE
—This is by far the first paper considering joint optimization of link scheduling, routing and replication for disruption-tolerant networks (DTNs). The optimization problems for...
ICS
2010
Tsinghua U.
14 years 2 months ago
2010
Tsinghua U.
ICASSP
2011
IEEE
12 years 8 months ago
2011
IEEE
The fundamental problem of our interest is soft MIMO detection for the case of block fading, i.e., when the transmitted codeword spans over several independent channel realization...
INFOCOM
2008
IEEE
13 years 11 months ago
2008
IEEE
—We introduce Zen, a new resource allocation framework that assigns application components to node clusters to achieve high availability for partial-fault tolerant (PFT) applicat...