Sciweavers

31 search results - page 1 / 7
» Effective Capacity and Randomness of Closed Sets
Sort
View
CORR
2010
Springer
43views Education» more  CORR 2010»
13 years 3 months ago
Effective Capacity and Randomness of Closed Sets
Douglas Cenzer, Paul Brodhead
INFOCOM
2008
IEEE
13 years 11 months ago
Capacity of Asynchronous Random-Access Scheduling in Wireless Networks
Abstract—We study the throughput capacity of wireless networks which employ (asynchronous) random-access scheduling as opposed to deterministic scheduling. The central question w...
Deepti Chafekar, Dave Levin, V. S. Anil Kumar, Mad...
INFOCOM
2010
IEEE
13 years 3 months ago
Change Management in Enterprise IT Systems: Process Modeling and Capacity-optimal Scheduling
Abstract—We provide a formal model for the Change Management process for Enterprise IT systems, and develop change scheduling algorithms that seek to attain the “change capacit...
Praveen Kumar Muthuswamy, Koushik Kar, Sambit Sahu...
INFOCOM
2011
IEEE
12 years 8 months ago
General capacity scaling of wireless networks
—We study the general scaling laws of the capacity for random wireless networks under the generalized physical model. The generality of this work is embodied in three dimensions ...
Cheng Wang, Changjun Jiang, Xiang-Yang Li, ShaoJie...
SSS
2010
Springer
134views Control Systems» more  SSS 2010»
13 years 3 months ago
Storage Capacity of Labeled Graphs
We consider the question of how much information can be stored by labeling the vertices of a connected undirected graph G using a constant-size set of labels, when isomorphic label...
Dana Angluin, James Aspnes, Rida A. Bazzi, Jiang C...