1091 search results - page 4 / 219 » Approximation Algorithms for Data Placement Problems |
114
Voted
ICNP
2006
IEEE
15 years 8 months ago
2006
IEEE
—Data caching can significantly improve the efficiency of information access in a wireless ad hoc network by reducing the access latency and bandwidth usage. However, designing e...
161
click to vote
NETWORKING
2008
15 years 4 months ago
2008
Caching popular content in the Internet has been recognized as one of the effective solution to alleviate network congestion and accelerate user information access. Sharing and coo...
115
Voted
IPPS
2007
IEEE
15 years 8 months ago
2007
IEEE
In DHT-based P2P systems, Replication-based content distribution and load balancing strategies consists of such decisions as which files should be replicated, how many replicas sh...
100
Voted
DAC
2005
ACM
16 years 3 months ago
2005
ACM
Placement migration is the movement of cells within an existing placement to address a variety of post-placement design closure issues, such as timing, routing congestion, signal ...
159
Voted
ISAAC
2009
Springer
15 years 9 months ago
2009
Springer
We introduce a new probing problem: what is the minimum number of cameras at fixed positions necessary and sufficient to reconstruct any strictly convex polygon contained in a dis...