4451 search results - page 103 / 891 » On Random Ordering Constraints |
135
click to vote
KR
2000
Springer
15 years 8 months ago
2000
Springer
Recent experimental results have shown that the strength of resolution, the propositional DPLL procedure, the KSAT procedure for description logics, or related tableau-like implem...
118
click to vote
SAC
2008
ACM
15 years 3 months ago
2008
ACM
Total Order Broadcast protocols are important tools to ensure coherence across distributed systems. Contrarily to classical distributed systems, pervasive systems bring important ...
138
click to vote
NOSSDAV
2005
Springer
15 years 10 months ago
2005
Springer
We are concerned with the fundamental problem of event ordering in multiplayer peer-to-peer games. Event ordering, even without faults, requires all-to-all message passing with at...
145
click to vote
CP
2006
Springer
15 years 8 months ago
2006
Springer
Dynamic Backtracking (DBT) is a well known algorithm for solving Constraint Satisfaction Problems. In DBT, variables are allowed to keep their assignment during backjump, if they a...
145
click to vote
DIAGRAMS
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. The spider diagram logic forms a fragment of constraint diagram logic and is designed to be primarily used as a diagrammatic software specification tool. Our interest is ...