6456 search results - page 169 / 1292 » Constraint Solving on Terms |
150
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...
206
click to vote
ICSOC
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. Service-based systems should be able to dynamically seek replacements for faulty or underperforming services, thus performing self-healing. It may however be the case tha...
152
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...
168
click to vote
CPAIOR
2009
Springer
16 years 1 months ago
2009
Springer
Context-free grammar constraints enforce that a sequence of variables forms a word in a language defined by a context-free grammar. The constraint has received a lot of attention ...
151
click to vote
ICTAI
2005
IEEE
16 years 1 days ago
2005
IEEE
Lotos is the ISO formal specification language for describing and verifying concurrent and distributed systems. The simulation or execution of complex Lotos specifications is, h...