Sciweavers

948 search results - page 22 / 190
» What can we achieve by arbitrary announcements
Sort
View
TARK
2007
Springer
14 years 1 months ago
Knowledge-based modelling of voting protocols
We contend that reasoning about knowledge is both natural and pragmatic for verification of electronic voting protocols. We present a model in which desirable properties of elect...
A. Baskar, Ramaswamy Ramanujam, S. P. Suresh
NIPS
1998
13 years 9 months ago
Finite-Sample Convergence Rates for Q-Learning and Indirect Algorithms
In this paper, we address two issues of long-standing interest in the reinforcement learning literature. First, what kinds of performance guarantees can be made for Q-learning aft...
Michael J. Kearns, Satinder P. Singh
CCS
2006
ACM
13 years 11 months ago
Secure hierarchical in-network aggregation in sensor networks
In-network aggregation is an essential primitive for performing queries on sensor network data. However, most aggregation algorithms assume that all intermediate nodes are trusted...
Haowen Chan, Adrian Perrig, Dawn Xiaodong Song
ICDCS
2002
IEEE
14 years 15 days ago
Bidding for Storage Space in a Peer-to-Peer Data Preservation System
Digital archives protect important data collections from failures by making multiple copies at other archives, so that there are always several good copies of a collection. In a c...
Brian F. Cooper, Hector Garcia-Molina
ICNP
2005
IEEE
14 years 1 months ago
The Fundamental Role of Hop Distance in IEEE802.11 Multi-Hop Ad Hoc Networks
In wireless networks, it is well understood what throughput can be achieved by nodes who can hear each other (i.e. nodes within a single cell)[1, 3]. The effects of nodes beyond t...
Yan Gao, Dah-Ming Chiu, John C. S. Lui