Sciweavers

89 search results - page 11 / 18
» Fast paths in large-scale dynamic road networks
Sort
View
MOBICOM
2004
ACM
14 years 1 months ago
A study on the feasibility of mobile gateways for vehicular ad-hoc networks
Development in Wireless LAN and Cellular technologies has motivated recent efforts to integrate the two. This creates new application scenarios that were not possible before. Veh...
Vinod Namboodiri, Manish Agarwal, Lixin Gao
ADHOC
2004
134views more  ADHOC 2004»
13 years 8 months ago
Scalable team multicast in wireless ad hoc networks exploiting coordinated motion
In this paper, we study a new multicast paradigm for large scale mobile ad hoc networks, namely team multicast. In team multicast the multicast group does not consist of individua...
Yunjung Yi, Mario Gerla, Katia Obraczka
COMCOM
2007
82views more  COMCOM 2007»
13 years 8 months ago
On application-level load balancing in FastReplica
— In the paper, we consider the problem of distributing large-size content to a fixed set of nodes. In contrast with the most existing end-system solutions to this problem, Fast...
Jangwon Lee, Gustavo de Veciana
EMMCVPR
2003
Springer
14 years 1 months ago
Curve Matching Using the Fast Marching Method
Common techniques for curve alignment find a solution in the form of a shortest network path by means of dynamic programming. In this paper we present an approach that employs Set...
Max Frenkel, Ronen Basri
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
14 years 8 months ago
Fast convergence to Wardrop equilibria by adaptive sampling methods
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
Simon Fischer, Harald Räcke, Berthold Vö...