614 search results - page 17 / 123 » Computational Complexity of Multi-way, Dataflow Constraint P... |
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
A problem of joint optimal bandwidth and power allocation in cognitive networks under fading channels is considered. It is assumed that multiple secondary users (SUs) share the sp...
DAGSTUHL
2006
13 years 9 months ago
2006
Abstract. The Galois connection involving polymorphisms and coclones has received a lot of attention in regard to constraint satisfaction problems. However, it fails if we are inte...
IAT
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
SAT
2004
Springer
14 years 1 months ago
2004
Springer
Kolaitis and Vardi pointed out that constraint satisfaction and conjunctive query containment are essentially the same problem. We study the Boolean conjunctive queries under a mor...