717 search results - page 62 / 144 » Weak-Commitment Search for Solving Constraint Satisfaction P... |
165
click to vote
GIS
2007
ACM
2007
ACM
Exploiting automatically inferred constraint-models for building identification in satellite imagery
15 years 11 months ago
The building identification (BID) problem is based on a process that uses publicly available information to automatically assign addresses to buildings in satellite imagery. In pr...
104
click to vote
SODA
2010
ACM
14 years 8 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
AAAI
1997
14 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...
CSCLP
2007
Springer
15 years 4 months ago
2007
Springer
Global constraints are used in constraint programming to help users specify patterns that occur frequently in the real world. In addition, global constraints facilitate the use of ...
CP
2008
Springer
14 years 11 months ago
2008
Springer
The Quantified Constraint Satisfaction Problem (QCSP) has been introduced to express situations in which we are not able to control the value of some of the variables (the universa...