A reason to distribute constraint satisfaction is privacy: agents may not want to share their values, and they may wish to keep constraints as private as possible. In this paper, w...
Abstract. This paper studies algorithms for the Disjunctive Temporal Problem (DTP) a quite general temporal reasoning problem introduced in [12]. This problem involves the satisfac...
DisFC is an ABT-like algorithm that, instead of sending the value taken by the high priority agent, it sends the domain of the low priority agent that is compatible with that value...
This paper describes an efficient implementation of binning for decode-and-forward (DF) in relay channels using lowdensity parity-check (LDPC) codes. Bilayer LDPC codes are devised...
ple (Extended Abstract) Edmund M. Clarke and Sergey Berezin Carnegie Mellon University -- USA Model checking is an automatic verification technique for finite state concurrent syst...