Sciweavers

5138 search results - page 333 / 1028
» Low-Entropy Set Selection.
Sort
View
IPL
2008
77views more  IPL 2008»
15 years 6 months ago
On the coordinator's rule for Fast Paxos
Fast Paxos is an algorithm for consensus that works by a succession of rounds, where each round tries to decide a value v that is consistent with all past rounds. Rounds are start...
Gustavo M. D. Vieira, Luiz Eduardo Buzato
171
Voted
RSA
2006
81views more  RSA 2006»
15 years 6 months ago
On random points in the unit disk
Let n be a positive integer and > 0 a real number. Let Vn be a set of n points in the unit disk selected uniformly and independently at random. Define G(, n) to be the graph w...
Robert B. Ellis, Xingde Jia, Catherine H. Yan
IAT
2009
IEEE
16 years 1 months ago
Cluster-Swap: A Distributed K-median Algorithm for Sensor Networks
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....
Yoonheui Kim, Victor R. Lesser, Deepak Ganesan, Ra...
IPTPS
2005
Springer
16 years 9 days ago
Evaluating DHT-Based Service Placement for Stream-Based Overlays
Stream-based overlay networks (SBONs) are one approach to implementing large-scale stream processing systems. A fundamental consideration in an SBON is that of service placement, ...
Peter R. Pietzuch, Jeffrey Shneidman, Jonathan Led...
SWAT
2004
Springer
156views Algorithms» more  SWAT 2004»
16 years 4 days ago
The Bottleneck Problem with Minimum Quantity Commitments
Given an edge-distance graph of a set of suppliers and clients, the bottleneck problem is to assign each client to a selected supplier minimizing their maximum distance. We introdu...
Andrew Lim, Zhou Xu