714 search results - page 115 / 143 » Lexicographically-ordered constraint satisfaction problems |
ECAI
1992
Springer
14 years 1 months ago
1992
Springer
Constraint satisfaction problems (CSPs) provide a model often used in Artificial Intelligence. Since the problem of the existence of a solution in a CSP is an NP-complete task, man...
IJCAI
2003
13 years 11 months ago
2003
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
AAAI
1997
13 years 11 months ago
1997
We report on the performance of an enhanced version of the “Davis-Putnam” (DP) proof procedure for propositional satisfiability (SAT) on large instances derived from realworld...
TWC
2008
13 years 9 months ago
2008
It is a challenging task for multi-hop wireless networks to support multimedia applications with quality-ofservice (QoS) requirements. This letter presents a joint crosslayer optim...
CP
2005
Springer
14 years 3 months ago
2005
Springer
The two most popular backtrack algorithms for solving Constraint Satisfaction Problems (CSPs) are Forward Checking (FC) and Maintaining Arc Consistency (MAC). MAC maintains full ar...