5624 search results - page 45 / 1125 » On Conditional Covering Problem |
117
Voted
COMPGEOM
2009
ACM
15 years 9 months ago
2009
ACM
We consider the set multi-cover problem in geometric settings. Given a set of points P and a collection of geometric shapes (or sets) F, we wish to nd a minimum cardinality subse...
111
Voted
IPPS
2006
IEEE
15 years 8 months ago
2006
IEEE
role assignment is a programming abstraction that supports the assignment of user-defined roles to sensor nodes such that certain conditions are met. Many common network configu...
148
click to vote
ICALP
2010
Springer
15 years 7 months ago
2010
Springer
The general problem of robust optimization is this: one of several possible scenarios will appear tomorrow, but things are more expensive tomorrow than they are today. What should...
108
click to vote
DCC
2002
IEEE
15 years 2 months ago
2002
IEEE
Asymptotically bounding the covering radius in terms of the dual distance is a well-studied problem. We will combine the polynomial approach with estimates of the distance distribu...
112
Voted
ISAAC
2009
Springer
15 years 9 months ago
2009
Springer
Given m unit disks and n points in the plane, the discrete unit disk cover problem is to select a minimum subset of the disks to cover the points. This problem is NP-hard [11] and ...