243 search results - page 10 / 49 » Parallel and distributed algorithms for finite constraint sa... |
142
click to vote
CSE
2009
IEEE
15 years 10 months ago
2009
IEEE
—Constraint satisfaction has been a very successful paradigm for solving problems such as resource allocation and planning. Many of these problems pose themselves in a context in...
135
click to vote
AIMSA
2008
Springer
15 years 5 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....
115
click to vote
MST
2008
15 years 3 months ago
2008
We investigate the complexity of the satisfiability problem of constraints over finite totally ordered domains. In our context, a clausal constraint is a disjunction of inequaliti...
103
click to vote
CP
2003
Springer
15 years 8 months ago
2003
Springer
We provide a reformulation of the constraint hierarchies (CHs) framework based on the notion of error indicators. Adapting the generalized view of local consistency in semiring-ba...
129
Voted
SCP
1998
15 years 3 months ago
1998
Consistency techniques are an e cient way of tackling constraint satisfaction problems (CSP). In particular, various arc-consistency algorithms have been designed such as the time...