570 search results - page 11 / 114 » The Complexity of Reasoning with Global Constraints |
CP
2004
Springer
15 years 1 months ago
2004
Springer
Scheduling is one of the most successful application areas of constraint programming mainly thanks to special global constraints designed to model resource restrictions. Among thes...
109
click to vote
ATAL
2009
Springer
15 years 4 months ago
2009
Springer
Previous work in multiagent coordination has addressed the challenge of planning in domains where agents must optimize a global goal, while satisfying local resource constraints. ...
CSL
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. Establishing local consistency is one of the main algorithmic techniques in temporal and spatial reasoning. In this area, one of the central questions for the various pro...
JACM
2010
14 years 8 months ago
2010
A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
105
click to vote
CP
2007
Springer
15 years 3 months ago
2007
Springer
While many real-world combinatorial problems can be advantageously modeled and solved using Constraint Programming, scalability remains a major issue in practice. Constraint models...