2845 search results - page 134 / 569 » Constraints over Ontologies |
164
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...
151
click to vote
CORR
2008
Springer
15 years 5 months ago
2008
Springer
The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distribut...
156
click to vote
TIT
2011
15 years 1 months ago
2011
—The capacity of 1-D constraints is given by the entropy of a corresponding stationary maxentropic Markov chain. Namely, the entropy is maximized over a set of probability distri...
165
click to vote
COMPSAC
2008
IEEE
16 years 1 months ago
2008
IEEE
Path-oriented Random Testing (PRT) aims at generating a uniformly spread out sequence of random test data that activate a single control flow path within an imperative program. T...
168
click to vote
FROCOS
2007
Springer
16 years 21 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 ...