— This paper focuses on controlling absorbing sets for a class of regular LDPC codes, known as separable, circulantbased (SCB) codes. For a specified circulant matrix, SCB codes...
Abstract Given a collection of individual preferences defined on a same finite set of candidates, we consider the problem of aggregating them into a collective preference minimizin...
In recent years, Boolean Satisfiability (SAT) has been shown to hold potential for Unbounded Model Checking (UMC). The success of SAT-based UMC largely relies on (i) the SAT solv...
In a variety of applications, ranging from data integration to distributed query evaluation, there is a need to obtain sets of data items from several sources (peers) and compute ...
We propose a novel approach to encapsulate non-deterministic computations in functional logic programs. Our approach is based on set functions that return the set of all the resul...