Sciweavers

1074 search results - page 92 / 215
» Parallelizing post-placement timing optimization
Sort
View
PODC
2000
ACM
14 years 16 days ago
Efficient atomic broadcast using deterministic merge
We present an approach for merging message streams from producers distributed over a network, using a deterministic algorithm that is independent of any nondeterminism of the syst...
Marcos Kawazoe Aguilera, Robert E. Strom
DCOSS
2008
Springer
13 years 10 months ago
Efficient Node Discovery in Mobile Wireless Sensor Networks
Energy is one of the most crucial aspects in real deployments of mobile sensor networks. As a result of scarce resources, the duration of most real deployments can be limited to ju...
Vladimir Dyo, Cecilia Mascolo
CORR
2007
Springer
111views Education» more  CORR 2007»
13 years 9 months ago
Comments on "Design and performance evaluation of load distribution strategies for multiple loads on heterogeneous linear daisy
Min, Veeravalli, and Barlas have proposed strategies to minimize the overall execution time of one or several divisible loads on a heterogeneous linear network, using one or more ...
Matthieu Gallet, Yves Robert, Frédér...
IPPS
1999
IEEE
14 years 1 months ago
Sparse Hypercube: A Minimal k-Line Broadcast Graph
This paper proposes a method for reducing the maximum degree of vertices in graphs that maintain optimal broadcast time when a vertex can call a vertex at distance at most k durin...
Satoshi Fujita, Arthur M. Farley
DCOSS
2010
Springer
14 years 8 days ago
Approximate Distributed Kalman Filtering for Cooperative Multi-agent Localization
Abstract. We consider the problem of estimating the locations of mobile agents by fusing the measurements of displacements of the agents as well as relative position measurements b...
Prabir Barooah, Wm. Joshua Russell, João P....