Sciweavers

1220 search results - page 216 / 244
» Minimal Interval Completions
Sort
View
WAOA
2010
Springer
246views Algorithms» more  WAOA 2010»
13 years 5 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
TWC
2010
13 years 2 months ago
Outage Probability Analysis of Cognitive Transmissions: Impact of Spectrum Sensing Overhead
In cognitive radio networks, a cognitive source node requires two essential phases to complete a cognitive transmission process: the phase of spectrum sensing with a certain time d...
YuLong Zou, Yu-Dong Yao, Baoyu Zheng
ALDT
2011
Springer
200views Algorithms» more  ALDT 2011»
12 years 7 months ago
Vote Elicitation with Probabilistic Preference Models: Empirical Estimation and Cost Tradeoffs
A variety of preference aggregation schemes and voting rules have been developed in social choice to support group decision making. However, the requirement that participants provi...
Tyler Lu, Craig Boutilier
ICC
2011
IEEE
215views Communications» more  ICC 2011»
12 years 7 months ago
Optimal Packet Scheduling in a Broadcast Channel with an Energy Harvesting Transmitter
—In this paper, we investigate the transmission completion time minimization problem in a two-user additive white Gaussian noise (AWGN) broadcast channel, where the transmitter i...
Jing Yang, Omur Ozel, Sennur Ulukus
ISCA
2005
IEEE
101views Hardware» more  ISCA 2005»
14 years 1 months ago
Near-Optimal Worst-Case Throughput Routing for Two-Dimensional Mesh Networks
Minimizing latency and maximizing throughput are important goals in the design of routing algorithms for interconnection networks. Ideally, we would like a routing algorithm to (a...
Daeho Seo, Akif Ali, Won-Taek Lim, Nauman Rafique,...