287 search results - page 19 / 58 » An Algebraic Approach to Constraint Satisfaction Problems |
RSS
2007
13 years 9 months ago
2007
— In this paper we present an implicit time-stepping scheme for multibody systems with intermittent contact by incorporating the contact constraints as a set of complementarity a...
AIMSA
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
FOCS
2002
IEEE
14 years 18 days ago
2002
IEEE
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to ...