12659 search results - page 208 / 2532 » The distributed breakout algorithms |
138
click to vote
PODC
2010
ACM
15 years 7 months ago
2010
ACM
Low overhead analysis of large distributed data sets is necessary for current data centers and for future sensor networks. In such systems, each node holds some data value, e.g., ...
200
click to vote
ACST
2006
15 years 6 months ago
2006
This paper investigates the applicability of distributed clustering technique, called RACHET [1], to organize large sets of distributed text data. Although the authors of RACHET c...
155
click to vote
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...
146
click to vote
AAAI
2008
15 years 7 months ago
2008
Most former studies of Distributed Constraint Optimization Problems (DisCOPs) search considered only complete search algorithms, which are practical only for relatively small prob...
152
click to vote
QEST
2009
IEEE
16 years 6 days ago
2009
IEEE
—We consider a distributed shuffling algorithm for sharing data in a distributed network. Nodes executing the algorithm periodically contact each other and exchange data. The be...