Sciweavers

278 search results - page 52 / 56
» Two Upper Bounds on the Chromatic Number
Sort
View
CORR
2006
Springer
129views Education» more  CORR 2006»
13 years 7 months ago
On the Optimality of the ARQ-DDF Protocol
The performance of the automatic repeat request-dynamic decode and forward (ARQ-DDF) cooperation protocol is analyzed in two distinct scenarios. The first scenario is the multiple...
Kambiz Azarian, Hesham El Gamal, Philip Schniter
SODA
2012
ACM
177views Algorithms» more  SODA 2012»
11 years 9 months ago
Stochastic coalescence in logarithmic time
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...
Po-Shen Loh, Eyal Lubetzky
FOCS
2009
IEEE
14 years 2 months ago
Choice-Memory Tradeoff in Allocations
In the classical balls-and-bins paradigm, where n balls are placed independently and uniformly in n bins, typically the number of bins with at least two balls in them is Θ(n) and ...
Noga Alon, Eyal Lubetzky, Ori Gurel-Gurevich
SIGMETRICS
2009
ACM
126views Hardware» more  SIGMETRICS 2009»
14 years 1 months ago
Self-adaptive admission control policies for resource-sharing systems
We consider the problem of admission control in resource sharing systems, such as web servers and transaction processing systems, when the job size distribution has high variabili...
Varun Gupta, Mor Harchol-Balter
FOIS
2006
13 years 8 months ago
A Dynamic Theory of Ontology
Natural languages are easy to learn by infants, they can express any thought that any adult might ever conceive, and they accommodate the limitations of human breathing rates and s...
John F. Sowa