858 search results - page 100 / 172 » A Glimpse of Constraint Satisfaction |
SIGMOD
2011
ACM
12 years 10 months ago
2011
ACM
In a previous paper, we laid out the vision of declarative datadriven coordination (D3C) where users are provided with novel abstractions that enable them to communicate and coord...
CSCLP
2007
Springer
14 years 2 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 ...
COMPULOG
1999
Springer
14 years 2 days ago
1999
Springer
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
GIS
2007
ACM
2007
ACM
Exploiting automatically inferred constraint-models for building identification in satellite imagery
14 years 8 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...
IGPL
2006
13 years 7 months ago
2006
Abstract. k-SAT is a fundamental constraint satisfaction problem. It involves S(m), the satisfaction set of the conjunction of m clauses, each clause a disjunction of k literals. T...