Sciweavers

183 search results - page 23 / 37
» The Degree Distribution of Random k-Trees
Sort
View
CPE
1998
Springer
115views Hardware» more  CPE 1998»
14 years 25 days ago
On Choosing a Task Assignment Policy for a Distributed Server System
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...
Mor Harchol-Balter, Mark Crovella, Cristina D. Mur...
PODC
2010
ACM
14 years 15 days ago
A new technique for distributed symmetry breaking
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...
Johannes Schneider, Roger Wattenhofer
PODC
2010
ACM
14 years 15 days ago
Deterministic distributed vertex coloring in polylogarithmic time
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...
Leonid Barenboim, Michael Elkin
HICSS
2010
IEEE
131views Biometrics» more  HICSS 2010»
14 years 3 months ago
Using "Last-Minute" Sales for Vertical Differentiation on the Internet
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...
Ori Marom, Abraham Seidmann
ISPAN
2005
IEEE
14 years 2 months ago
Overlay networks with class
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...
Giovanni Chiola, Gennaro Cordasco, Luisa Gargano, ...