— We consider the problem of distributed scheduling in wireless networks. We present two different algorithms whose performance is arbitrarily close to that of maximal schedules,...
This paper examines a simulation of the Beer Distribution Game and a number of optimisation approaches to this game. This well known game was developed at MIT in the 1960s and has ...
Complexity theory typically studies the complexity of computing a function h(x) : {0, 1}m {0, 1}n of a given input x. A few works have suggested to study the complexity of genera...
We consider the distributed implementability problem as: Given a labeled transition system TS together with a distribution ∆ of its actions over a set of processes, does there ex...
One feature of many naturally occurring or engineered complex systems is tremendous variability in event sizes. To account for it, the behavior of these systems is often described...
Walter Willinger, David Alderson, John C. Doyle, L...