Sciweavers

2497 search results - page 371 / 500
» Requirements for models of achievable routing
Sort
View
126
Voted
IPPS
2008
IEEE
15 years 8 months ago
Sweep coverage with mobile sensors
Many efforts have been made for addressing coverage problems in sensor networks. They fall into two categories, full coverage and barrier coverage, featured as static coverage. In...
Wei-Fang Cheng, Mo Li, Kebin Liu, Yunhao Liu, Xian...
CN
2007
100views more  CN 2007»
15 years 1 months ago
A simple FIFO-based scheme for differentiated loss guarantees
— Today’s Internet carries an ever broadening range of application traffic with different requirements. This has stressed its original, one-class, best-effort model, and has b...
Yaqing Huang, Roch Guérin
CORR
2010
Springer
189views Education» more  CORR 2010»
15 years 1 months ago
Coalition Formation Games for Collaborative Spectrum Sensing
Abstract--Collaborative Spectrum Sensing (CSS) between secondary users (SUs) in cognitive networks exhibits an inherent tradeoff between minimizing the probability of missing the d...
Walid Saad, Zhu Han, Tamer Basar, Mérouane ...
TCOM
2010
195views more  TCOM 2010»
14 years 8 months ago
Coherent and Differential Space-Time Shift Keying: A Dispersion Matrix Approach
Abstract--Motivated by the recent concept of Spatial Modulation (SM), we propose a novel Space-Time Shift Keying (STSK) modulation scheme for Multiple-Input Multiple-Output (MIMO) ...
Shinya Sugiura, Sheng Chen, Lajos Hanzo
FOCS
2009
IEEE
15 years 8 months ago
Symmetry and Approximability of Submodular Maximization Problems
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
Jan Vondrák