1300 search results - page 38 / 260 » Constraint satisfaction problems and global cardinality cons... |
101
click to vote
ICDCS
2000
IEEE
15 years 2 months ago
2000
IEEE
We present resolvent-based learning as a new nogood learning method for a distributed constraint satisfaction algorithm. This method is based on a look-back technique in constrain...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
A genetic algorithm encoding is proposed which is able to automatically satisfy a class of important cardinality constraints where the set of distinct values of the design variabl...
76
Voted
IPL
2008
14 years 9 months ago
2008
Max-SAT-CC is the following optimization problem: Given a formula in CNF and a bound k, find an assignment with at most k variables being set to true that maximizes the number of ...
CCS
2001
ACM
15 years 2 months ago
2001
ACM
The reachability problem for cryptographic protocols with nonatomic keys can be solved via a simple constraint satisfaction procedure.
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. Data exchanges between Web services engaged in a composition raise several heterogeneities. In this paper, we address the problem of data cardinality heterogeneity in a c...