419 search results - page 40 / 84 » An LP-Designed Algorithm for Constraint Satisfaction |
CORR
2010
Springer
13 years 8 months ago
2010
Springer
The constraint satisfaction problem (CSP) is a central generic problem in artificial intelligence. Considerable effort has been made in identifying properties which ensure tractabi...
RECOMB
2004
Springer
14 years 8 months ago
2004
Springer
In this paper we describe an algorithm for the localization of structured models, i.e. sequences of (simple) motifs and distance constraints. It basically combines standard patter...
CSCLP
2005
Springer
14 years 2 months ago
2005
Springer
Problems that can be sampled randomly are a good source of test suites for comparing quality of constraint satisfaction techniques. Quasigroup problems are representatives of struc...
ECAI
2008
Springer
13 years 10 months ago
2008
Springer
The objective of the Maximal Constraint Satisfaction Problem (Max-CSP) is to find an instantiation which minimizes the number of constraint violations in a constraint network. In t...
DISOPT
2007
13 years 8 months ago
2007
The class Max (r, 2)-CSP (or simply Max 2-CSP) consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m bin...