763 search results - page 81 / 153 » Engineering Shortest Path Algorithms |
134
click to vote
ISCC
2003
IEEE
15 years 7 months ago
2003
IEEE
Multicasting is an efficient and effective approach for supporting content distribution based on the current Internet infrastructure. In this paper, we have proposes the source-in...
114
Voted
AAAI
2000
15 years 3 months ago
2000
We consider the use of multi-agent systems to control network routing. Conventional approaches to this task are based on Ideal Shortest Path routing Algorithm (ISPA), under which ...
103
click to vote
ICUMT
2009
14 years 12 months ago
2009
In this paper we compare the performance of tree different dynamic traffic engineering algorithms exploiting path diversity in the Internet, TEXCP, TRUMP and MIRTO. We passed throu...
137
Voted
FSTTCS
2008
Springer
15 years 3 months ago
2008
Springer
ABSTRACT. We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON ...
148
Voted
PEPM
1995
ACM
15 years 5 months ago
1995
ACM
This paper concerns a method for approximating the possible “shapes” that heap-allocated structures in a program can take on. We present a new approach to finding solutions t...