277 search results - page 2 / 56 » Conditional Lexicographic Orders in Constraint Satisfaction ... |
AI
2006
Springer
13 years 5 months ago
2006
Springer
Finite-domain constraint programming has been used with great success to tackle a wide variety of combinatorial problems in industry and academia. To apply finite-domain constrain...
CPAIOR
2009
Springer
13 years 12 months ago
2009
Springer
Abstract: This paper introduces six ways for handling a chain of lexicographic ordering constraint between the origins of identical orthotopes (e.g., rectangles, boxes, hyper-recta...
AMC
2008
13 years 5 months ago
2008
Abstract Nowadays many real problems can be modelled as Constraint Satisfaction Problems (CSPs). A search algorithm for constraint programming requires an order in which variables ...
AMAI
1999
Springer
13 years 5 months ago
1999
Springer
Temporal Constraint Satisfaction Problems (TCSP) is a well known approach for representing and processing temporal knowledge. Important properties of the knowledge can be inferred...
AAAI
2006
13 years 6 months ago
2006