942 search results - page 101 / 189 » Distance Constraint Satisfaction Problems |
113
click to vote
GLOBECOM
2008
IEEE
15 years 9 months ago
2008
IEEE
— In this paper we study the complexity of spectrum assignment problems in cognitive radio networks (CRNs) in the presence of several constraints. Although optimal spectrum assig...
112
Voted
AIPS
2000
15 years 4 months ago
2000
Currently, Graphplan and Blackbox, which converts Graphplan's plan graph into the satisfaction (SAT) problem, are two of the most successful planners. Since Graphplan gains i...
110
click to vote
SGAI
2007
Springer
15 years 9 months ago
2007
Springer
Constraint Satisfaction Problems can be solved using either iterative improvement or constructive search approaches. Iterative improvement techniques converge quicker than the cons...
114
click to vote
SAT
2004
Springer
15 years 8 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...
145
click to vote
AUSAI
2007
Springer
15 years 7 months ago
2007
Springer
Factor analysis is a statistical technique for reducing the number of factors responsible for a matrix of correlations to a smaller number of factors that may reflect underlying va...