Sciweavers

2814 search results - page 327 / 563
» Competitive Analysis of Distributed Algorithms
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
PODS
2011
ACM
238views Database» more  PODS 2011»
13 years 1 months ago
Beyond simple aggregates: indexing for summary queries
Database queries can be broadly classified into two categories: reporting queries and aggregation queries. The former retrieves a collection of records from the database that mat...
Zhewei Wei, Ke Yi
WISEC
2009
ACM
14 years 5 months ago
Towards a theory for securing time synchronization in wireless sensor networks
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
Murtuza Jadliwala, Qi Duan, Shambhu J. Upadhyaya, ...
SSS
2009
Springer
128views Control Systems» more  SSS 2009»
14 years 3 months ago
Dependability Engineering of Silent Self-stabilizing Systems
Self-stabilization is an elegant way of realizing non-masking fault-tolerant systems. Sustained research over last decades has produced multiple self-stabilizing algorithms for man...
Abhishek Dhama, Oliver E. Theel, Pepijn Crouzen, H...
IJCAI
2003
14 years 5 days ago
Covariant Policy Search
We investigate the problem of non-covariant behavior of policy gradient reinforcement learning algorithms. The policy gradient approach is amenable to analysis by information geom...
J. Andrew Bagnell, Jeff G. Schneider