Sciweavers

146 search results - page 21 / 30
» Vehicle routing and scheduling with dynamic travel times
Sort
View
AGENTS
2001
Springer
14 years 13 days ago
An auction-based method for decentralized train scheduling
We present a computational study of an auction-based method for decentralized train scheduling. The method is well suited to the natural information and control structure of moder...
David C. Parkes, Lyle H. Ungar
INFOCOM
2011
IEEE
12 years 11 months 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
2002
IEEE
127views VLSI» more  FCCM 2002»
14 years 26 days ago
Hardware-Assisted Fast Routing
To fully realize the benefits of partial and rapid reconfiguration of field-programmable devices, we often need to dynamically schedule computing tasks and generate instance-sp...
André DeHon, Randy Huang, John Wawrzynek
SAGT
2009
Springer
163views Game Theory» more  SAGT 2009»
14 years 2 months ago
Nash Equilibria and the Price of Anarchy for Flows over Time
We study Nash equilibria and the price of anarchy in the context of flows over time. Many results on static routing games have been obtained over the last ten years. In flows ov...
Ronald Koch, Martin Skutella
INFOCOM
2003
IEEE
14 years 1 months ago
A Dynamic RWA Algorithm in a Wavelength-Routed All-Optical Network with Wavelength Converters
—Existing research demonstrated that an effective Routing and Wavelength Assignment (RWA) scheme and a wavelength converter placement algorithm are the two primary vehicles for i...
Xiaowen Chu, Bo Li