Sciweavers

540 search results - page 25 / 108
» Competitive Routing over Time
Sort
View
INFOCOM
2010
IEEE
13 years 7 months ago
Random Walks on Digraphs: A Theoretical Framework for Estimating Transmission Costs in Wireless Routing
—In this paper we develop a unified theoretical framework for estimating various transmission costs of packet forwarding in wireless networks. Our framework can be applied to th...
Yanhua Li, Zhi-Li Zhang
ICDE
2011
IEEE
272views Database» more  ICDE 2011»
13 years 22 days ago
A continuous query system for dynamic route planning
—In this paper, we address the problem of answering continuous route planning queries over a road network, in the presence of updates to the delay (cost) estimates of links. A si...
Nirmesh Malviya, Samuel Madden, Arnab Bhattacharya
EOR
2007
100views more  EOR 2007»
13 years 9 months ago
Designing delivery districts for the vehicle routing problem with stochastic demands
This paper considers the problem of designing districts for vehicle routing problems with stochastic demands. In particular, demands are assumed to be uncertain at the time when t...
Dag Haugland, Sin C. Ho, Gilbert Laporte
INFOCOM
2011
IEEE
13 years 22 days ago
Timely data delivery in a realistic bus network
Abstract—WiFi-enabled buses and stops may form the backbone of a metropolitan delay tolerant network, that exploits nearby communications, temporary storage at stops, and predict...
Utku Acer, Paolo Giaccone, David Hay, Giovanni Neg...
FCCM
2006
IEEE
131views VLSI» more  FCCM 2006»
14 years 3 months ago
Packet Switched vs. Time Multiplexed FPGA Overlay Networks
— Dedicated, spatially configured FPGA interconnect is efficient for applications that require high throughput connections between processing elements (PEs) but with a limited ...
Nachiket Kapre, Nikil Mehta, Michael DeLorimier, R...