1378 search results - page 103 / 276 » The Tractability of Global Constraints |
177
click to vote
SARA
2007
Springer
16 years 14 days ago
2007
Springer
Though there exist some rules of thumb for design of good models for solving constraint satisfaction problems, the modeling process still belongs more to art than to science. Moreo...
167
click to vote
ESOP
2007
Springer
16 years 16 days ago
2007
Springer
Abstract. Service Level Agreements are a key issue in Service Oriented Computing. SLA contracts specify client requirements and service guarantees, with emphasis on Quality of Serv...
152
click to vote
AAAI
2007
15 years 8 months ago
2007
We present a general framework for determining the number of solutions of constraint satisfaction problems (CSPs) with a high precision. Our first strategy uses additional binary...
140
click to vote
CAV
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. Size-change termination involves deducing program termination based on the impossibility of infinite descent. To this end we may use m abstraction in which transitions ar...
143
click to vote
ICTAI
2000
IEEE
15 years 10 months ago
2000
IEEE
In this paper, we address the problem of consistency checking for Euclidean spatial constraints. A dimension graph representation is proposed to maintain the Euclidean spatial con...