143 search results - page 7 / 29 » Timed CSP: A Retrospective |
ESA
2006
Springer
15 years 1 months ago
2006
Springer
The class Max (r, 2)-CSP consists of constraint satisfaction problems with at most two r-valued variables per clause. For instances with n variables and m binary clauses, we presen...
IJCAI
1989
14 years 11 months ago
1989
A constraint satisfaction problem, or CSP, can be reformulated as an integer linear programming problem. The reformulated problem can be solved via polynomial multiplication. If t...
CP
2010
Springer
14 years 8 months ago
2010
Springer
In this paper we show that the power of using k-consistency techniques in a constraint problem is precisely captured by using a particular inference rule, which we call positive-hy...
TIME
2005
IEEE
15 years 3 months ago
2005
IEEE
We exploit the fact that qualitative Interval Algebra (IA) network problems are finite domain CSPs. In the first part of the paper, we show how to convert a qualitative IA network ...
CSIE
2009
IEEE
14 years 11 months ago
2009
IEEE
The critical spare parts (CSP) is essential to machine operation, which is also more expensive, have longer purchasing lead time and larger demand variation than non-critical spar...