Sciweavers

714 search results - page 96 / 143
» Lexicographically-ordered constraint satisfaction problems
Sort
View
SAT
2004
Springer
101views Hardware» more  SAT 2004»
14 years 3 months ago
An Algebraic Approach to the Complexity of Generalized Conjunctive Queries
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...
Michael Bauland, Philippe Chapdelaine, Nadia Creig...
ICASSP
2008
IEEE
14 years 4 months ago
Utility-based power control for peer-to-peer cognitive radio networks with heterogeneous QoS constraints
Transmit-power control is a critical task in cognitive radio (CR) networks. In the present contribution, adherence to hierarchies between primary and secondary users in a peer-to-...
Nikolaos Gatsis, Antonio G. Marqués, Georgi...
GIS
1995
ACM
14 years 1 months ago
Collaborative Spatial Decision Making with Qualitative Constraints
: Usually spatial planning problems involve a large number of decision makers with different backgrounds and interests. The process of Collaborative Spatial Decision Making (CSDM)...
Nikos I. Karacapilidis, Dimitris Papadias, Max J. ...
STACS
2009
Springer
14 years 4 months ago
Enumerating Homomorphisms
The homomorphism problem for relational structures is an abstract way of formulating constraint satisfaction problems (CSP) and various problems in database theory. The decision ve...
Andrei A. Bulatov, Víctor Dalmau, Martin Gr...
CSLP
2004
Springer
14 years 1 months ago
Multi-dimensional Graph Configuration for Natural Language Processing
Many tasks in computational linguistics can be regarded as configuration problems. In this paper, we introduce the notion of lexicalised multi-dimensional configuration problems (l...
Ralph Debusmann, Denys Duchier, Marco Kuhlmann