2410 search results - page 35 / 482 » Multiset Ordering Constraints |
150
click to vote
ACSD
2010
IEEE
15 years 2 months ago
2010
IEEE
We extend the partial order reduction algorithm of Clarke et al. [CJM00] to handle branching security protocols, such as optimistic fair exchange protocols. Applications of the pro...
108
click to vote
IJCAI
2001
15 years 5 months ago
2001
This paper challenges the prevailing pessimism about the scalability of partial order planning (POP) algorithms by presenting several novel heuristic control techniques that make ...
135
click to vote
CORR
2006
Springer
2006
Springer
Dense Gaussian Sensor Networks: Minimum Achievable Distortion and the Order Optimality of Separation
15 years 4 months ago
We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements...
112
click to vote
CONCUR
1997
Springer
15 years 8 months ago
1997
Springer
Eventstructuremodelsoftenhavesomeconstraintwhichensuresthatforeachsystemrunitisclearwhatarethecausalpredecessorsofanevent(i.e. there is no causal ambiguity). In this contribution w...
160
click to vote
JAIR
2011
14 years 11 months ago
2011
In this paper, we propose a comprehensive study of second-order consistencies (i.e., consistencies identifying inconsistent pairs of values) for constraint satisfaction. We build ...