Sciweavers

5580 search results - page 85 / 1116
» Randomized priority algorithms
Sort
View
JSAC
2010
104views more  JSAC 2010»
14 years 8 months ago
A priority-based processor sharing model for TDM passive optical networks
—The use of passive optical networks (PONs) enables access rates of multi-Gbit/sec bandwidth and provision of quality of service for high definition multimedia services. In this...
Yan Wang, Moshe Zukerman, Ron Addie, Sammy Chan, R...
IPPS
1996
IEEE
15 years 2 months ago
Practical Algorithms for Selection on Coarse-Grained Parallel Computers
In this paper, we consider the problem of selection on coarse-grained distributed memory parallel computers. We discuss several deterministic and randomized algorithms for paralle...
Ibraheem Al-Furaih, Srinivas Aluru, Sanjay Goil, S...
ESA
2004
Springer
120views Algorithms» more  ESA 2004»
15 years 3 months ago
Maximum Matchings in Planar Graphs via Gaussian Elimination
We present a randomized algorithm for finding maximum matchings in planar graphs in time O(nω/2 ), where ω is the exponent of the best known matrix multiplication algorithm. Sin...
Marcin Mucha, Piotr Sankowski
ADHOCNOW
2008
Springer
14 years 11 months ago
Communication in Random Geometric Radio Networks with Positively Correlated Random Faults
Abstract. We study the feasibility and time of communication in random geometric radio networks, where nodes fail randomly with positive correlation. We consider a set of radio sta...
Evangelos Kranakis, Michel Paquette, Andrzej Pelc