— We define the concept of approximate domain optimizer for deterministic and expected value optimization criteria. Roughly speaking, a candidate optimizer is an approximate dom...
Andrea Lecchini-Visintini, John Lygeros, Jan M. Ma...
Abstract— While peer-to-peer consensus algorithms have enviable robustness and locality for distributed estimation and computation problems, they have poor scaling behavior with ...
Jong-Han Kim, Matthew West, Sanjay Lall, Eelco Sch...
—This paper studies a network under TCP congestion control, in which the number of flows per user is explicitly taken into account. We present a control law for this variable th...
We propose a shape population metric that reflects the interdependencies between points observed in a set of examples. It provides a notion of topology for shape and appearance m...
This paper proposes a formally well-rooted and extensible framework for dependability evaluation: Arcade (architectural dependability evaluation). It has been designed to combine ...
Hichem Boudali, Pepijn Crouzen, Boudewijn R. Haver...