Sciweavers

4041 search results - page 75 / 809
» time 2009
Sort
View
INFOCOM
2009
IEEE
16 years 28 days ago
Polynomial Time Approximations for Multi-Path Routing with Bandwidth and Delay Constraints
— In this paper, we study the problem of multi-path routing with bandwidth and delay constraints, which arises in applications for video delivery over bandwidth-limited networks....
Satyajayant Misra, Guoliang Xue, Dejun Yang
ICRA
2009
IEEE
98views Robotics» more  ICRA 2009»
16 years 28 days ago
Multi-robot routing with linear decreasing rewards over time
Abstract— We study multi-robot routing problems (MRLDR) where a team of robots has to visit a set of given targets with linear decreasing rewards over time, such as required for ...
Ali Ekici, Pinar Keskinocak, Sven Koenig
DATE
2009
IEEE
103views Hardware» more  DATE 2009»
16 years 1 months ago
Masking timing errors on speed-paths in logic circuits
There is a growing concern about timing errors resulting from design marginalities and the effects of circuit aging on speed-paths in logic circuits. This paper presents a low ove...
Mihir R. Choudhury, Kartik Mohanram
INFOCOM
2009
IEEE
16 years 28 days ago
Minimizing Average Finish Time in P2P Networks
—Peer-to-peer (P2P) file distribution is a scalable way to disseminate content to a wide audience. For a P2P network, one fundamental performance metric is the average time need...
G. Matthew Ezovski, Ao Tang, Lachlan L. H. Andrew
SAGT
2009
Springer
163views Game Theory» more  SAGT 2009»
16 years 25 days 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