4117 search results - page 164 / 824 » On the Satisfiability of Complex Constraints |
153
click to vote
SAT
2004
Springer
15 years 12 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...
174
click to vote
COSIT
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. The Double Cross calculus has been proposed for the purpose of navigation based on qualitative information about spatial configurations. Up until now, however, no result...
130
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
The issue of multiuser cooperation in a complexity constrained noise-free CDMA channel is addressed. Multiuser cooperation is imperative if conventional demodulation is expected to...
187
click to vote
ATAL
2005
Springer
16 years 2 days ago
2005
Springer
One of the difficulties to adapt MDPs for the control of cooperative multi-agent systems, is the complexity issued from Decentralized MDPs. Moreover, existing approaches can not ...
152
click to vote
VLSID
2007
IEEE
16 years 6 months ago
2007
IEEE
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...