Sciweavers

1051 search results - page 103 / 211
» Foundations of Constraint Satisfaction
Sort
View
DSS
2007
113views more  DSS 2007»
13 years 10 months ago
An associate constraint network approach to extract multi-lingual information for crime analysis
International crime and terrorism have drawn increasing attention in recent years. Retrieving relevant information from criminal records and suspect communications is important in...
Christopher C. Yang, Kar Wing Li
CSCLP
2007
Springer
14 years 4 months ago
Generalizing Global Constraints Based on Network Flows
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 ...
Igor Razgon, Barry O'Sullivan, Gregory M. Provan
COMPULOG
1999
Springer
14 years 2 months ago
Decomposable Constraints
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
Ian P. Gent, Kostas Stergiou, Toby Walsh
GIS
2007
ACM
14 years 11 months ago
Exploiting automatically inferred constraint-models for building identification in satellite imagery
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...
Martin Michalowski, Craig A. Knoblock, Kenneth M. ...
IGPL
2006
87views more  IGPL 2006»
13 years 10 months ago
Satisfiability Decay along Conjunctions of Pseudo-Random Clauses
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...
Eli Shamir