Sciweavers

1446 search results - page 198 / 290
» Local zero knowledge
Sort
View
127
Voted
INFOCOM
2007
IEEE
15 years 9 months ago
Self-Adaptive On Demand Geographic Routing Protocols for Mobile Ad-hoc Networks
— It has been a big challenge to develop routing protocol that can meet different application needs and optimize routing paths according to the topology change in mobile ad hoc n...
X. Xiang, Z. Zhou, X. Wang
115
Voted
PAKDD
1999
ACM
124views Data Mining» more  PAKDD 1999»
15 years 6 months ago
Discovery of Equations and the Shared Operational Semantics in Distributed Autonomous Databases
Empirical equations are an important class of regularities that can be discovered in databases. In this paper we concentrate on the role of equations as de nitions of attribute val...
Zbigniew W. Ras, Jan M. Zytkow
ICS
2010
Tsinghua U.
15 years 6 months ago
Memory Consistency Conditions for Self-Assembly Programming
: Perhaps the two most significant theoretical questions about the programming of self-assembling agents are: (1) necessary and sufficient conditions to produce a unique terminal a...
Aaron Sterling
147
Voted
CONEXT
2009
ACM
15 years 3 months ago
The age of impatience: optimal replication schemes for opportunistic networks
: We study mobile P2P content dissemination schemes which leverage the local dedicated caches provided by hand-held devices (e.g., smart-phones, PDAs) and opportunistic contacts be...
Joshua Reich, Augustin Chaintreau
ADHOC
2007
144views more  ADHOC 2007»
15 years 2 months ago
Adaptive gossip protocols: Managing security and redundancy in dense ad hoc networks
Abstract. Many ad hoc routing algorithms rely on broadcast flooding for location discovery or, more generally, for secure routing applications. Flooding is a robust algorithm but ...
Mike Burmester, Tri Van Le, Alec Yasinsac