Sciweavers

1494 search results - page 249 / 299
» Polynomial time algorithms for network information flow
Sort
View
SAC
2004
ACM
14 years 2 months ago
A decision-theoretic approach for designing proactive communication in multi-agent teamwork
Techniques that support effective communication during teamwork processes are of particular importance. Psychological study shows that an effective team often can anticipate infor...
Yu Zhang, Richard A. Volz, Thomas R. Ioerger, John...
CDC
2010
IEEE
226views Control Systems» more  CDC 2010»
13 years 3 months ago
Fast primal-dual projected linear iterations for distributed consensus in constrained convex optimization
In this paper we study the constrained consensus problem, i.e. the problem of reaching a common point from the estimates generated by multiple agents that are constrained to lie in...
Ion Necoara, Ioan Dumitrache, Johan A. K. Suykens
DMSN
2009
ACM
14 years 3 months ago
FSort: external sorting on flash-based sensor devices
In long-term deployments of Wireless Sensor Networks, it is often more efficient to store sensor readings locally at each device and transmit those readings to the user only when ...
Panayiotis Andreou, Orestis Spanos, Demetrios Zein...
DISCEX
2003
IEEE
14 years 2 months ago
Improving Failure Responsiveness in Jini Leasing
Distributed systems require strategies to detect and recover from failures. Many protocols for distributed systems employ a strategy based on leases, which grant a leaseholder acc...
Scott Rose, Kevin Bowers, Stephen Quirolgico, Kevi...
CORR
2008
Springer
138views Education» more  CORR 2008»
13 years 8 months ago
Order-Optimal Consensus through Randomized Path Averaging
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
Florence Bénézit, Alexandros G. Dima...