An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
generally meta-data, so that documents on any specific subject can be transparently retrieved. While quality control can in principle still rely on the traditional methods of peer-...
This paper describes the architecture and implementation of MIKE - a version of the IK distributed persistent object-oriented programming platform built on top of the Mach microke...
Miguel Castro, Nuno Neves, Pedro Trancuso, Pedro S...
— Approximating the sum of Log–Normal random variables (RVs) is a long–standing open issue, in the old and recent literature, and many approaches have been proposed to deal w...
Marco Di Renzo, Fabio Graziosi, Fortunato Santucci
Distributed mobile applications operate on devices with diverse capabilities, in heterogeneous environments, where parameters such as processor, memory and network utilisation, are...