Sciweavers

293 search results - page 35 / 59
» Possibilistic Networks with Locally Weighted Knowledge Bases
Sort
View
JSAC
2007
155views more  JSAC 2007»
13 years 7 months ago
Semantic social overlay networks
— Peer selection for query routing is a core task in peer-to-peer networks. Unstructured peer-to-peer systems (like Gnutella) ignore this problem, leading to an abundance of netw...
Alexander Löser, Steffen Staab, Christoph Tem...
KIVS
2005
Springer
14 years 1 months ago
Caching for Improved Retrieval in Peer-to-Peer Networks
: In modern information systems the dominant retrieval paradigms have shifted from exact matching towards retrieving a list of the most relevant objects. This is because users usua...
Wolf-Tilo Balke, Wolfgang Nejdl, Wolf Siberski, Uw...
CDC
2009
IEEE
160views Control Systems» more  CDC 2009»
13 years 5 months ago
Exploring and exploiting routing opportunities in wireless ad-hoc networks
Abstract--In this paper, d-AdaptOR, a distributed opportunistic routing scheme for multi-hop wireless ad-hoc networks is proposed. The proposed scheme utilizes a reinforcement lear...
Abhijeet Bhorkar, Mohammad Naghshvar, Tara Javidi,...
ADHOC
2007
144views more  ADHOC 2007»
13 years 7 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
CONEXT
2009
ACM
13 years 8 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