1091 search results - page 13 / 219 » Approximation Algorithms for Data Placement Problems |
130
Voted
NETWORKS
2006
15 years 2 months ago
2006
We study two packing problems that arise in the area of dissemination-based information systems; a second theme is the study of distributed approximation algorithms. The problems c...
130
Voted
ICPP
2008
IEEE
15 years 9 months ago
2008
IEEE
—Data replications is a typical strategy for improving access performance and data availability in Data Grid systems. Current works on data replication in Grid systems focus on t...
152
Voted
INFOCOM
2006
IEEE
15 years 8 months ago
2006
IEEE
Abstract— Sensors typically use wireless transmitters to communicate with each other. However, sensors may be located in a way that they cannot even form a connected network (e.g...
135
Voted
SODA
2004
ACM
15 years 4 months ago
2004
ACM
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
117
Voted
CDC
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract— This paper presents new algorithms for conducting cooperative sensing using a mobile backbone network. This hierarchical sensing approach combines backbone nodes, which...