A fundamental fact in the analysis of randomized algorithm is that when n balls are hashed into n bins independently and uniformly at random, with high probability each bin contai...
L. Elisa Celis, Omer Reingold, Gil Segev, Udi Wied...
Abstract--This work studies the near-optimality versus the complexity of distributed configuration management for wireless networks. We first develop a global probabilistic graphic...
This article introduces a fully automated verification technique that permits to analyze real-time systems described using a continuous notion of time and a mixture of operational...
The abilityto predict the performance of a simulationapplicationbefore its implementationis an important factor to the adoption of parallel simulation technology in industry. Idea...
We consider optimal real-time scheduling of periodic tasks on multiprocessors—i.e., satisfying all task deadlines, when the total utilization demand does not exceed the ion capa...
Hyeonjoong Cho, Binoy Ravindran, E. Douglas Jensen