14158 search results - page 404 / 2832 » Generalized switch-setting problems |
132
Voted
CORR
1998
Springer
15 years 4 months ago
1998
Springer
We examine the computational complexity of testing and nding small plans in probabilistic planning domains with both at and propositional representations. The complexity of plan e...
141
click to vote
JACM
1998
15 years 4 months ago
1998
Given a collection Ᏺ of subsets of S ϭ {1, . . . , n}, set cover is the problem of selecting as few as possible subsets from Ᏺ such that their union covers S, and max k-cover ...
175
click to vote
SIAMCOMP
1998
15 years 4 months ago
1998
Motivated by applications in computer graphics, visualization, and scienti c computation, we study the computational complexity of the following problem: Given a set S of n points...
160
click to vote
SMR
2002
15 years 4 months ago
2002
This study reports results from an empirical study of 54 software maintainers in the software maintenance department of a Norwegian company. The study addresses the relationship b...
175
click to vote
TPDS
2002
15 years 4 months ago
2002
Distributed dynamic channel allocation (DDCA) is a fundamental resource management problem in mobile cellular networks. It has a flavor of distributed mutual exclusion but is not e...