183 search results - page 23 / 37 » The Degree Distribution of Random k-Trees |
146
Voted
CPE
1998
Springer
15 years 10 months ago
1998
Springer
We consider a distributed server system model and ask which policy should be used for assigning tasks to hosts. In our model each host processes tasks in First-Come-First-Serve ord...
161
Voted
PODC
2010
ACM
15 years 9 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
162
click to vote
PODC
2010
ACM
15 years 9 months ago
2010
ACM
Consider an n-vertex graph G = (V, E) of maximum degree ∆, and suppose that each vertex v ∈ V hosts a processor. The processors are allowed to communicate only with their neig...
159
click to vote
HICSS
2010
IEEE
16 years 22 days ago
2010
IEEE
In Internet based commerce, sellers often use multiple distribution channels for the sale of standard consumer goods. We study a model of second degree price discrimination in whi...
176
click to vote
ISPAN
2005
IEEE
15 years 11 months ago
2005
IEEE
We define a family of Distributed Hash Table systems whose aim is to combine routing efficiency of the randomized networks — i.e. average path length O(log n/ log log n) vs. t...