Sciweavers

5580 search results - page 99 / 1116
» Randomized priority algorithms
Sort
View
INFOCOM
2007
IEEE
15 years 10 months ago
Optimal Rate-Reliability-Delay Tradeoff in Networks with Composite Links
—Networks need to accommodate diverse applications with different Quality-of-Service (QoS) requirements. New ideas at the physical layer are being developed for this purpose, suc...
Ying Li, Mung Chiang, A. Robert Calderbank, Suhas ...
INFOCOM
2002
IEEE
15 years 9 months ago
BSFQ: Bin Sort Fair Queueing
—Existing packet schedulers that provide fair sharing of an output link can be divided into two classes: sorted priority and frame-based. Sorted priority methods provide excellen...
Shun Yan Cheung, Corneliu S. Pencea
VTC
2008
IEEE
224views Communications» more  VTC 2008»
15 years 11 months ago
Dynamic Spectrum Allocation in Wireless Cognitive Sensor Networks: Improving Fairness and Energy Efficiency
Abstract- This paper considers the centralized spectrum allocations in resource-constrained wireless sensor networks with the following goals: (1) allocate spectrum as fairly as po...
Sang-Seon Byun, Ilangko Balasingham, Xuedong Liang
DATE
2006
IEEE
145views Hardware» more  DATE 2006»
15 years 10 months ago
Improved offset-analysis using multiple timing-references
In this paper, we present an extension to existing approaches that capture and exploit timing-correlation between tasks for scheduling analysis in distributed systems. Previous ap...
Rafik Henia, Rolf Ernst
ATVA
2004
Springer
77views Hardware» more  ATVA 2004»
15 years 10 months ago
Localizing Errors in Counterexample with Iteratively Witness Searching
We propose a novel approach to locate errors in complex counterexample of safety property. Our approach measures the distance between two state transition traces with difference o...
ShengYu Shen, Ying Qin, Sikun Li