194 search results - page 10 / 39 » Computing Roundness is Easy if the Set is Almost Round |
FC
2001
Springer
14 years 3 days ago
2001
Springer
Abstract. This paper presents a new protocol for M + 1st-price auction, a style of auction in which the highest M bidders win and pay a uniform price, determined by the (M + 1)st p...
FOCS
1993
IEEE
13 years 11 months ago
1993
IEEE
: Weprove tight bounds on the time needed to solve k-set agreement, a natural generalization of consensus. We analyze this problem in a synchronous, message-passing model where pro...
BROADNETS
2007
IEEE
14 years 1 months ago
2007
IEEE
—Epidemic protocols assume that information of a random set of nodes is provided at each protocol round. By definition, the random set needs to be chosen uniformly and randomly ...
PODC
2011
ACM
12 years 10 months ago
2011
ACM
In this paper we study the problem of building a connected dominating set with constant degree (CCDS) in the dual graph radio network model [4,9,10]. This model includes two types...
IMC
2003
ACM
14 years 26 days ago
2003
ACM
We measured and analyzed the variability in round trip times (RTTs) within TCP connections using passive measurement techniques. We collected eight hours of bidirectional traces c...