Sciweavers

383 search results - page 53 / 77
» A Bound on the Total Chromatic Number
Sort
View
INFOCOM
2010
IEEE
13 years 8 months ago
Opportunistic Spectrum Access with Multiple Users: Learning under Competition
Abstract—The problem of cooperative allocation among multiple secondary users to maximize cognitive system throughput is considered. The channel availability statistics are initi...
Animashree Anandkumar, Nithin Michael, Ao Tang
INFOCOM
2011
IEEE
13 years 1 months ago
SelectCast: Scalable data aggregation scheme in wireless sensor networks
—In this work, for a wireless sensor network (WSN) of n randomly placed sensors with node density λ ∈ [1, n], we study the tradeoffs between the aggregation throughput and gat...
Cheng Wang, ShaoJie Tang, Xiang-Yang Li, Changjun ...
WAOA
2010
Springer
246views Algorithms» more  WAOA 2010»
13 years 8 months ago
Tradeoff between Energy and Throughput for Online Deadline Scheduling
The past few years have witnessed a number of interesting online algorithms for deadline scheduling in the dynamic speed scaling model (in which a processor can vary its speed to ...
Ho-Leung Chan, Tak Wah Lam, Rongbin Li
ISPD
2012
ACM
283views Hardware» more  ISPD 2012»
12 years 6 months ago
Low-power gated bus synthesis for 3d ic via rectilinear shortest-path steiner graph
In this paper, we propose a new approach for gated bus synthesis [16] with minimum wire capacitance per transaction in three-dimensional (3D) ICs. The 3D IC technology connects di...
Chung-Kuan Cheng, Peng Du, Andrew B. Kahng, Shih-H...
WINE
2005
Springer
109views Economy» more  WINE 2005»
14 years 3 months ago
Subjective-Cost Policy Routing
We study a model of path-vector routing in which nodes’ routing policies are based on subjective cost assessments of alternative routes. The routes are constrained by the requir...
Joan Feigenbaum, David R. Karger, Vahab S. Mirrokn...