1298 search results - page 61 / 260 » The online set cover problem |
IJSNET
2008
14 years 9 months ago
2008
Abstract: This paper addresses the target coverage problem in wireless sensor networks. Communication and sensing consume energy, therefore efficient power management can extend ne...
JAL
2006
14 years 9 months ago
2006
In this paper we consider the unsplittable flow problem (UFP): given a directed or undirected network G = (V, E) with edge capacities and a set of terminal pairs (or requests) wit...
KDD
2012
ACM
13 years 6 days ago
2012
ACM
Online reviews provide consumers with valuable information that guides their decisions on a variety of fronts: from entertainment and shopping to medical services. Although the pr...
ESA
2009
Springer
15 years 4 months ago
2009
Springer
We give a general framework for the problem of finding all minimal hitting sets of a family of objects in Rd by another. We apply this framework to the following problems: (i) hit...
CHI
2006
ACM
15 years 10 months ago
2006
ACM
This paper reports on issues related to the use of mobile phones by older people. This study uses triangulation, a mixed method of qualitative (focus group discussions) and quanti...