16404 search results - page 775 / 3281 » A set coverage problem |
169
click to vote
CCCG
2003
15 years 9 months ago
2003
A decomposition of a polygon P is a set of polygons whose geometric union is exactly P. We consider the problem of decomposing a polygon, which may contain holes, using subpolygon...
180
click to vote
WSC
2001
15 years 8 months ago
2001
A constrained Monte Carlo problem arises when one computes an expectation in the presence of a priori computable constraints on the expectations of quantities that are correlated ...
172
click to vote
ACL
1994
15 years 8 months ago
1994
1 We examine the consistency problem for descriptions of trees based on remote dominance, and present a consistency-checking algorithm which is polynomial in the number of nodes in...
189
click to vote
ECAI
2010
Springer
15 years 8 months ago
2010
Springer
The verification problem for action logic programs with non-terminating behaviour is in general undecidable. In this paper, we consider a restricted setting in which the problem be...
162
click to vote
CORR
2010
Springer
15 years 7 months ago
2010
Springer
We provide an O(log log OPT)-approximation algorithm for the problem of guarding a simple polygon with guards on the perimeter. We first design a polynomial-time algorithm for bui...