Sciweavers

2084 search results - page 200 / 417
» Proving Time Bounds for Randomized Distributed Algorithms
Sort
View
124
Voted
ISPAN
1999
IEEE
15 years 6 months ago
Distributed Clustering for Ad Hoc Networks
A Distributed Clustering Algorithm DCA and a Distributed Mobility-Adaptive Clustering DMAC algorithm are presented that partition the nodes of a fully mobile network ad hoc networ...
Stefano Basagni
NIXDORF
1992
127views Hardware» more  NIXDORF 1992»
15 years 6 months ago
Three non Conventional Paradigms of Parallel Computation
Abstract. We consider three paradigms of computation where the bene ts of a parallel solution are greater than usual. Paradigm 1 works on a time-varying input data set, whose size ...
Fabrizio Luccio, Linda Pagli, Geppino Pucci
124
Voted
ATAL
2009
Springer
15 years 9 months ago
A distributed constraint optimization approach for coordination under uncertainty
Distributed Constraint Optimization (DCOP) provides a rich framework for modeling multi-agent coordination problems. Existing problem domains for DCOP focus on small (<100 vari...
James Atlas
GOSLER
1995
15 years 6 months ago
Learning and Consistency
In designing learning algorithms it seems quite reasonable to construct them in such a way that all data the algorithm already has obtained are correctly and completely reflected...
Rolf Wiehagen, Thomas Zeugmann
164
Voted
JPDC
2006
187views more  JPDC 2006»
15 years 2 months ago
Maximum lifetime data sensing and extraction in energy constrained networked sensor systems
We focus on data gathering problems in energy constrained networked sensor systems. The system operates in rounds where a subset of the sensors generate a certain number of data p...
Bo Hong, Viktor K. Prasanna