73 search results - page 2 / 15 » A Landscape Analysis of Constraint Satisfaction Problems |
CORR
2000
Springer
15 years 11 days ago
2000
Springer
CCS
2001
ACM
15 years 5 months ago
2001
ACM
The reachability problem for cryptographic protocols with nonatomic keys can be solved via a simple constraint satisfaction procedure.
117
Voted
JACM
2010
14 years 11 months ago
2010
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
100
click to vote
CISSE
2009
Springer
15 years 4 months ago
2009
Springer
: We show that estimating the complexity (mean and distribution) of the instances of a fixed size Constraint Satisfaction Problem (CSP) can be very hard. We deal with the main two ...
AAAI
1990
15 years 1 months ago
1990
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...