5180 search results - page 222 / 1036 » Concurrency, Time, and Constraints |
167
click to vote
CP
2008
Springer
15 years 8 months ago
2008
Springer
We propose new filtering algorithms for the SEQUENCE constraint and some extensions of the SEQUENCE constraint based on network flows. We enforce domain consistency on the SEQUENCE...
175
click to vote
AICOM
2004
15 years 6 months ago
2004
Abstract. Dechter et al. [5] proposed solving the Temporal Constraint Satisfaction Problem (TCSP) by modeling it as a metaCSP, which is a finite CSP with a unique global constraint...
172
click to vote
FROCOS
2007
Springer
16 years 24 days ago
2007
Springer
Often when formalising dynamic systems, constraints such as exactly “n” of a set of values hold. In this paper, we consider reasoning about propositional linear time temporal ...
176
click to vote
APSEC
2005
IEEE
16 years 8 days ago
2005
IEEE
Several kinds of call-ordering problems have been identified, all of which present subtle difficulties in ensuring the correctness of a sequential program. They include object pro...
165
click to vote
CP
2005
Springer
16 years 5 days ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...