459 search results - page 39 / 92 » Approximation Algorithms for Buy-at-Bulk Geometric Network D... |
JCO
2010
13 years 7 months ago
2010
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
ALGOSENSORS
2007
Springer
14 years 2 months ago
2007
Springer
We introduce Semi-Matching with Demands (SMD), which models a certain problem in sensor networks of assigning individual sensors to sensing tasks. If there are multiple sensing tas...
STACS
2001
Springer
14 years 1 months ago
2001
Springer
We consider the problem of computing an optimal range assignment in a wireless network which allows a specified source station to perform a broadcast operation. In particular, we ...
SIGGRAPH
2010
ACM
14 years 1 months ago
2010
ACM
Paper architectures are 3D paper buildings created by folding and cutting. The creation process of paper architecture is often laborintensive and highly skill-demanding, even with...
COMSWARE
2007
IEEE
14 years 18 days ago
2007
IEEE
Migration to a converged network has caused service providers to deploy real time applications such as voice over an IP (VoIP) network. From the provider's perspective, the s...