663 search results - page 45 / 133 » Algorithms for Computing Minimal Unsatisfiable Subsets of Co... |
MOBIHOC
2001
ACM
14 years 7 months ago
2001
ACM
The development of practical, localized algorithms is probably the most needed and most challenging task in wireless ad-hoc sensor networks (WASNs). Localized algorithms are a spe...
GRID
2007
Springer
13 years 7 months ago
2007
Springer
In the facility location problem (FLP) we are given a set of facilities and a set of clients, each of which is to be served by one facility. The goal is to decide which subset of f...
DCG
2000
13 years 7 months ago
2000
We consider the problem of approximating a polygonal chain C by another polygonal chain C whose vertices are constrained to be a subset of the set of vertices of C. The goal is to ...
CONSTRAINTS
2011
13 years 2 months ago
2011
We introduce a novel global constraint for the total weighted completion time of activities on a single unary capacity resource. For propagating the constraint, we propose an O(n4...
SACMAT
2006
ACM
14 years 1 months ago
2006
ACM
Separation of Duty (SoD) is widely recognized to be a fundamental principle in computer security. A Static SoD (SSoD) policy states that in order to have all permissions necessary...