This paper considers the average consensus problem on a network of digital links, and proposes algorithms based on pairwise "gossip" communications and updates. Through ...
Ruggero Carli, Fabio Fagnani, Paolo Frasca, Sandro...
We present a new probabilistic algorithm to find a finite set of points intersecting the closure of each connected component of the realization of every sign condition over a fami...
This paper gives an overview of recent results concerning the modular derivation of (i) modal specification logics, (ii) notions of simulation together with logical characterisati...
We present some improved bounds on necessary conditions for separating hash families of type {w, w} and type {w, w - 1}. In particular, these bounds apply to secure frameproof cod...
An urn-ball probabilistic model of the labor market is developed. Agents can be employed, (voluntary or involuntary) unemployed or entrepreneurs. The analytical long run equilibri...