Sciweavers

2485 search results - page 443 / 497
» Distributed parameter estimation in networks
Sort
View
SPAA
1996
ACM
14 years 26 days ago
From AAPC Algorithms to High Performance Permutation Routing and Sorting
Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and ...
Thomas Stricker, Jonathan C. Hardwick
PODC
2009
ACM
14 years 9 months ago
Brief announcement: minimum spanning trees and cone-based topology control
Consider a setting where nodes can vary their transmission power thereby changing the network topology, the goal of topology control is to reduce the transmission power while ensu...
Alejandro Cornejo, Nancy A. Lynch
SENSYS
2004
ACM
14 years 2 months ago
The flooding time synchronization protocol
Wireless sensor network applications, similarly to other distributed systems, often require a scalable time synchronization service enabling data consistency and coordination. Thi...
Miklós Maróti, Branislav Kusy, Gyula...
IMC
2005
ACM
14 years 2 months ago
Poisson versus Periodic Path Probing (or, Does PASTA Matter?)
Abstract— The well-known PASTA (“Poisson Arrivals See Time Averages”) property states that, under very general conditions, the fraction of Poisson arrivals that observe an un...
Muhammad Mukarram Bin Tariq, Amogh Dhamdhere, Cons...
ATAL
2009
Springer
14 years 3 months ago
Directed soft arc consistency in pseudo trees
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
Toshihiro Matsui, Marius-Calin Silaghi, Katsutoshi...