Sciweavers

13214 search results - page 391 / 2643
» Pseudorandomness for network algorithms
Sort
View
ICC
2007
IEEE
139views Communications» more  ICC 2007»
16 years 1 months ago
Impatient Backoff Algorithm: Fairness in a Distributed Ad-Hoc MAC
— Many distributed multiple access (MAC) protocols use an exponential backoff mechanism. In that mechanism, a node picks a random backoff time uniformly in an interval that doubl...
Rajarshi Gupta, Jean C. Walrand
INFOCOM
2003
IEEE
16 years 4 days ago
MEDF - A Simple Scheduling Algorithm for Two Real-Time Transport Service Classes with Application in the UTRAN
— In this paper, we consider real-time speech traffic, real-time circuit-switched data (CSD) and non-real-time packetswitched data (PSD) in the UMTS Terrestrial Radio Access Net...
Michael Menth, Matthias Schmid, Herbert Heiss, Tho...
ISCA
2002
IEEE
174views Hardware» more  ISCA 2002»
15 years 6 months ago
Efficient Task Partitioning Algorithms for Distributed Shared Memory Systems
In this paper, we consider the tree task graphs which arise from many important programming paradigms such as divide and conquer, branch and bound etc., and the linear task-graphs...
Sibabrata Ray, Hong Jiang
CIKM
2009
Springer
16 years 1 months ago
Progressive skyline query evaluation and maintenance in wireless sensor networks
Skyline query has been received much attention due to its wide application backgrounds for multi-preference and decision making. In this paper we consider skyline query evaluation...
Baichen Chen, Weifa Liang, Jeffrey Xu Yu
DIALM
1999
ACM
98views Algorithms» more  DIALM 1999»
15 years 11 months ago
Routing with guaranteed delivery in ad hoc wireless networks
We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are points in the plane and two nodes can communicate if the distance between them is...
Prosenjit Bose, Pat Morin, Ivan Stojmenovic, Jorge...