690 search results - page 69 / 138 » Multi-Agent Only Knowing |
SAINT
2005
IEEE
14 years 2 months ago
2005
IEEE
In this paper, we present Hierarchy-Based Anycast Routing (HAR), a routing protocol for collecting data over multi-hop, wireless sensor networks. The design of the protocol aims t...
SRDS
2005
IEEE
14 years 2 months ago
2005
IEEE
We present an algorithm by which nodes arranged in a tree, with each node initially knowing only its parent and children, can construct a fault-tolerant communication structure (a...
SC
2005
ACM
14 years 2 months ago
2005
ACM
Users often behave speculatively, submitting work that initially they do not know is needed. Farm computing often consists of single node speculative tasks issued by, e.g., bioinf...
APN
2005
Springer
14 years 2 months ago
2005
Springer
STGs give a formalism for the description of asynchronous circuits based on Petri nets. To overcome the state explosion problem one may encounter during circuit synthesis, a nondet...
ASIACRYPT
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. A two-argument function is computed privately by two parties if after the computation, no party should know anything about the other inputs except for what he is able to ...