749 search results - page 56 / 150 » Dualities for Constraint Satisfaction Problems |
CPAIOR
2004
Springer
15 years 2 months ago
2004
Springer
The graph isomorphism problem consists in deciding if two given graphs have an identical structure. This problem can be modeled as a constraint satisfaction problem in a very strai...
111
click to vote
PRICAI
1998
Springer
15 years 3 months ago
1998
Springer
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be ac...
SIAMCOMP
2010
14 years 5 months ago
2010
An equality template (also equality constraint language) is a relational structure with infinite universe whose relations can be defined by boolean combinations of equalities. We ...
103
click to vote
CORR
2010
Springer
14 years 8 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 ...
CORR
2008
Springer
14 years 11 months ago
2008
Springer
In this paper, we consider a cognitive radio (CR) network in which the unlicensed (secondary) users are allowed to concurrently access the spectrum allocated to the licensed (prim...