Let C(T) be a generalized Coxeter group, which has a natural map onto one of the classical Coxeter groups, either Bn or Dn. Let CY (T) be a natural quotient of C(T), and if C(T) is...
Iterative distributed algorithms are studied for computing arithmetic averages over networks of agents connected through memoryless broadcast erasure channels. These algorithms do...
Ruggero Carli, Giacomo Como, Paolo Frasca, Federic...
This work considers the problem of designing optimal multi-agent trajectories to patrol an environment. As performance criterion for optimal patrolling we consider the worst-case t...
Fabio Pasqualetti, Antonio Franchi, Francesco Bull...
Abstract. A system of Boolean equations is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an underlying hard ...
We develop a new mathematical model for describing a dynamical system at limited resolution (or finite scale), and we give precise meaning to the notion of a dynamical system havi...