Sciweavers

2808 search results - page 27 / 562
» Routing betweenness centrality
Sort
View
SAPIR
2004
Springer
15 years 10 months ago
Probabilistic Routing in Intermittently Connected Networks
We consider the problem of routing in intermittently connected networks. In such networks there is no guarantee that a fully connected path between source and destination exist at...
Anders Lindgren, Avri Doria, Olov Schelén
SKG
2005
IEEE
15 years 10 months ago
An Interest-based P2P RDF Query Architecture
Currently most centralized RDF storage and query architectures have problems in query performance and scalability. In this paper we present a distributed RDF query architecture to ...
Qian Gao, Zhihuan Qiu, Yu Wu, Jing Tian, Yafei Dai
STACS
1999
Springer
15 years 8 months ago
Worst-case Equilibria
We investigate the problem of routing traffic through a congested network in an environment of non-cooperative users. We use the worst-case coordination ratio suggested by Koutsou...
Elias Koutsoupias, Christos H. Papadimitriou
ADHOC
2007
91views more  ADHOC 2007»
15 years 4 months ago
Non-interactive key establishment in mobile ad hoc networks
We present a new non-interactive key agreement and progression (NIKAP) scheme for mobile ad hoc networks (MANETs), which does not require an on-line centralized authority, can non...
Zhenjiang Li, J. J. Garcia-Luna-Aceves
125
Voted
CSCW
2010
ACM
16 years 1 months ago
Information needs in bug reports: improving cooperation between developers and users
For many software projects, bug tracking systems play a central role in supporting collaboration between the developers and the users of the software. To better understand this co...
Silvia Breu, Rahul Premraj, Jonathan Sillito, Thom...