Sciweavers

2796 search results - page 41 / 560
» The coolest path problem
Sort
View
CPAIOR
2011
Springer
14 years 3 months ago
Upgrading Shortest Paths in Networks
We introduce the Upgrading Shortest Paths Problem, a new combinatorial problem for improving network connectivity with a wide range of applications from multicast communication to ...
Bistra N. Dilkina, Katherine J. Lai, Carla P. Gome...
WWIC
2007
Springer
102views Communications» more  WWIC 2007»
15 years 6 months ago
SCTP Performance Issue on Path Delay Differential
This paper studies the effect of path delay on SCTP performance. It focuses on the SCTP fast retransmit algorithm and demonstrates that the performance in the current retransmissio...
Yuansong Qiao, Enda Fallon, Liam Murphy, John Murp...
SENSYS
2003
ACM
15 years 5 months ago
Minimal and maximal exposure path algorithms for wireless embedded sensor networks
Sensor networks not only have the potential to change the way we use, interact with, and view computers, but also the way we use, interact with, and view the world around us. In o...
Giacomino Veltri, Qingfeng Huang, Gang Qu, Miodrag...
ICCAD
2006
IEEE
130views Hardware» more  ICCAD 2006»
15 years 8 months ago
On bounding the delay of a critical path
Process variations cause different behavior of timingdependent effects across different chips. In this work, we analyze one example of timing-dependent effects, crosscoupling ...
Leonard Lee, Li-C. Wang
VLDB
2007
ACM
114views Database» more  VLDB 2007»
16 years 1 days ago
Optimization and evaluation of shortest path queries
We investigate the problem of how to evaluate efficiently a collection of shortest path queries on massive graphs that are too big to fit in the main memory. To evaluate a shortes...
Edward P. F. Chan, Heechul Lim