Sciweavers

760 search results - page 17 / 152
» Efficient Communication Using Partial Information
Sort
View
DCOSS
2006
Springer
14 years 2 months ago
Efficient In-Network Processing Through Local Ad-Hoc Information Coalescence
We consider in-network processing via local message passing. The considered setting involves a set of sensors each of which can communicate with a subset of other sensors. There is...
Onur Savas, Murat Alanyali, Venkatesh Saligrama
DPD
2008
136views more  DPD 2008»
13 years 11 months ago
A cache invalidation scheme for continuous partial match queries in mobile computing environments
The continuous partial match query is a partial match query whose result remains consistently in the client's memory. Conventional cache invalidation methods for mobile client...
Yon Dohn Chung
CVPR
2004
IEEE
15 years 28 days ago
Propagation Networks for Recognition of Partially Ordered Sequential Action
We present Propagation Networks (P-Nets), a novel approach for representing and recognizing sequential activities that include parallel streams of action. We represent each activi...
Yifan Shi, Yan Huang, David Minnen, Aaron F. Bobic...
IAT
2005
IEEE
14 years 4 months ago
Analyzing Myopic Approaches for Multi-Agent Communication
Choosing when to communicate is a fundamental problem in multi-agent systems. This problem becomes particularly hard when communication is constrained and each agent has different...
Raphen Becker, Victor R. Lesser, Shlomo Zilberstei...
AIPS
2010
14 years 1 days ago
Incrementally Solving STNs by Enforcing Partial Path Consistency
Efficient management and propagation of temporal constraints is important for temporal planning as well as for scheduling. During plan development, new events and temporal constra...
Léon Planken, Mathijs de Weerdt, Neil Yorke...