410 search results - page 67 / 82 » Upgrading Shortest Paths in Networks |
204
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as finding s...
112
click to vote
ESA
2009
Springer
15 years 6 months ago
2009
Springer
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
INFOCOM
2005
IEEE
15 years 5 months ago
2005
IEEE
— In this paper, we propose to address the energy efficient routing problem in multi-hop wireless networks with accumulative relay. In the accumulative relay model, partially ov...
112
click to vote
MASS
2010
14 years 9 months ago
2010
Abstract--In a delay tolerant network (DTN), nodes are connected intermittently and the future node connections are mostly unknown. Since in these networks, a fully connected path ...
112
click to vote
MST
2011
14 years 6 months ago
2011
In this paper we generalize the Continuous Adversarial Queuing Theory (CAQT) model [5] by considering the possibility that the router clocks in the network are not synchronized. W...