2410 search results - page 59 / 482 » Multiset Ordering Constraints |
135
click to vote
ISORC
2005
IEEE
15 years 10 months ago
2005
IEEE
This paper is on the construction of a fault-tolerant and responsive server subsystem in an application context where the subsystem is accessed through an asynchronous network by ...
165
click to vote
SODA
2010
ACM
15 years 2 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
132
Voted
SARA
2007
Springer
15 years 10 months ago
2007
Springer
In order to apply constraint programming to a particular domain, the problem must first be modelled as a constraint satisfaction problem. There are typically many alternative mode...
153
click to vote
SAGA
2001
Springer
15 years 9 months ago
2001
Springer
We propose a generic, domain-independent local search method called adaptive search for solving Constraint Satisfaction Problems (CSP). We design a new heuristics that takes advan...
119
click to vote
CP
2008
Springer
15 years 6 months ago
2008
Springer
Submodular constraints play an important role both in theory and practice of valued constraint satisfaction problems (VCSPs). It has previously been shown, using results from the ...