538 search results - page 10 / 108 » Applying Interchangeability Techniques to the Distributed Br... |
117
Voted
PARA
2000
Springer
15 years 6 months ago
2000
Springer
Our proposal has the following key features: 1) The separation of a distributed program into a pure algorithm (PurAl) and a distribution/communication declaration (DUAL). This yie...
129
click to vote
IPSN
2005
Springer
15 years 8 months ago
2005
Springer
— In this paper, we propose a quantizer design algorithm that is optimized for source localization in sensor networks. For this application, the goal is to minimize the amount of...
127
Voted
ATAL
2010
Springer
15 years 3 months ago
2010
Springer
A major research challenge in multi-agent systems is the problem of partitioning a set of agents into mutually disjoint coalitions, such that the overall performance of the system...
121
Voted
ALGORITHMICA
2006
15 years 2 months ago
2006
Abstract. In this paper we present a coarse-grained parallel algorithm, CONQUEST, for constructing boundederror summaries of high-dimensional binary attributed data in a distribute...
114
Voted
DC
2000
15 years 2 months ago
2000
ms, to use abstraction mappings to prove probabilistic properties, and to apply random walk theory in a distributed computational setting. We apply all of these techniques to analy...