179 search results - page 28 / 36 » Polynomial Time Approximation Schemes for Geometric k-Cluste... |
MOBICOM
2006
ACM
14 years 1 months ago
2006
ACM
We consider the problem of throughput-optimal scheduling in wireless networks subject to interference constraints. We model the interference using a family of K-hop interference m...
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
RTCSA
2007
IEEE
14 years 2 months ago
2007
IEEE
An important property in a sensor network is the monitoring of temporal changes of hazardous situations such as forest fires. Rescue groups need to be aware of dynamic changes th...
AAAI
2008
13 years 10 months ago
2008
This paper considers the problem of an agent searching for a resource or a tangible good in a physical environment, where at each stage of its search it observes one source where ...