Sciweavers

3934 search results - page 96 / 787
» Approximate Schedulability Analysis
Sort
View
GLOBECOM
2008
IEEE
16 years 23 days ago
Capacity Analysis of an Opportunistic Scheduling System in a Spectrum Sharing Environment
Abstract—We analyze the capacity of an opportunistic scheduling system in a spectrum sharing environment where multiple secondary users can share a frequency spectrum with multip...
Tae Won Ban, Dan Keun Sung, Bang Chul Jung, Wan Ch...
MST
2002
152views more  MST 2002»
15 years 6 months ago
Average-Case Analysis of Greedy Packet Scheduling
We study the average number of delays suffered by packets routed using greedy (work conserving) scheduling policies. We obtain tight bounds on the worst-case average number of del...
Zvi Lotker, Boaz Patt-Shamir
MOBICOM
2006
ACM
16 years 8 days ago
Analysis and implications of student contact patterns derived from campus schedules
Characterizing mobility or contact patterns in a campus environment is of interest for a variety of reasons. Existing studies of these patterns can be classified into two basic a...
Vikram Srinivasan, Mehul Motani, Wei Tsang Ooi
APPROX
2006
Springer
107views Algorithms» more  APPROX 2006»
15 years 10 months ago
A Fast Random Sampling Algorithm for Sparsifying Matrices
We describe a simple random-sampling based procedure for producing sparse matrix approximations. Our procedure and analysis are extremely simple: the analysis uses nothing more th...
Sanjeev Arora, Elad Hazan, Satyen Kale
CISS
2008
IEEE
16 years 23 days ago
Distributed antenna system: Performance analysis in multi-user scenario
—This paper provides a comparative study of the distributed antenna system (DAS) and the conventional colocated antenna system (CAS) in the multi-user scenario. It is demonstrate...
Lin Dai