Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
In distributed, dynamic networks and applications, such as Peer-to-Peer (P2P), users'behaviour and quality of service/quality of experiment1 are known to influence each other....
Julien Siebert, Vincent Chevrier, Laurent Ciarlett...
Distributed cognition of dynamic processes is commonly observed in mobile groups of animates like schools of fish, hunting lions, or in human teams for sports or military maneuvers...
—In this paper we present an Information Theoretic Estimator for the number of sources mutually disjoint in a linear mixing model. The approach follows the Minimum Description Le...
—Given n discrete random variables = fX1;111; Xng, associated with any subset of f1; 2; 111; ng, there is a joint entropy H(X) where X = fXi:i 2 g. This can be viewed as a f...