CP
2009
Springer
14 years 5 months ago
2009
Springer
We propose two new asynchronous algorithms for solving Distributed Constraint Satisfaction Problems (DisCSPs). The first algorithm, AFC-ng, is a nogood-based version of Asynchronou...
CP
2009
Springer
14 years 5 months ago
2009
Springer
When interval methods handle systems of equations over the reals, two main types of filtering/contraction algorithms are used to reduce the search space. When the system is well-co...
CP
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. Constraint propagation solvers interleave propagation, removing impossible values from variable domains, with search. The solver state is modified during propagation. But...
CP
2009
Springer
14 years 5 months ago
2009
Springer
In this work, we improve on existing work that studied the relationship between the proof system of modern SAT solvers and general resolution. Previous contributions such as those ...
CP
2009
Springer
14 years 5 months ago
2009
Springer
A problem that is inherent to the development and efficient use of solvers is that of tuning parameters. The CP community has a long history of addressing this task automatically. ...
CP
2009
Springer
14 years 5 months ago
2009
Springer
The goal of testing is to distinguish between a number of hypotheses about a systemfor example, dierent diagnoses of faults by applying input patterns and verifying or falsifying t...
CP
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. During this decade, it has been observed that many realworld graphs, like the web and some social and metabolic networks, have a scale-free structure. These graphs are ch...
CP
2009
Springer
14 years 5 months ago
2009
Springer
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
CP
2009
Springer
14 years 5 months ago
2009
Springer
The ALLDIFFERENT constraint was one of the first global constraints [17] and it enforces the conjunction of one binary constraint, the not-equal constraint, for every pair of varia...
CP
2009
Springer
14 years 5 months ago
2009
Springer
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each ...