Sciweavers

805 search results - page 55 / 161
» Enumerating All Solutions for Constraint Satisfaction Proble...
Sort
View
LATIN
2010
Springer
15 years 2 months ago
On Quadratic Threshold CSPs
A predicate P : {−1, 1}k → {0, 1} can be associated with a constraint satisfaction problem Max CSP(P). P is called “approximation resistant” if Max CSP(P) cannot be approxi...
Per Austrin, Siavosh Benabbas, Avner Magen
GIS
2007
ACM
16 years 5 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. ...
CP
2007
Springer
15 years 10 months ago
Breaking Value Symmetry
Symmetry is an important factor in solving many constraint satisfaction problems. One common type of symmetry is when we have symmetric values. We can eliminate such value symmetr...
Toby Walsh
AISC
2004
Springer
15 years 9 months ago
New Developments in Symmetry Breaking in Search Using Computational Group Theory
Symmetry-breaking in constraint satisfaction problems (CSPs) is a well-established area of AI research which has recently developed strong interactions with symbolic computation, i...
Tom Kelsey, Steve Linton, Colva M. Roney-Dougal
AAAI
1994
15 years 5 months ago
Small is Beautiful: A Brute-Force Approach to Learning First-Order Formulas
We describe a method for learning formulas in firstorder logic using a brute-force, smallest-first search. The method is exceedingly simple. It generates all irreducible well-form...
Steven Minton, Ian Underwood