3678 search results - page 472 / 736 » On the Stable Paths Problem |
128
Voted
HICSS
2003
IEEE
15 years 11 months ago
2003
IEEE
The hop constrained min-sum arborescence with outage costs problem consists of selecting links in a network so as to connect a set of terminal nodes N={2,3,……n} to a central n...
151
click to vote
INFOCOM
2003
IEEE
15 years 11 months ago
2003
IEEE
— Many topology discovery systems rely on traceroute to discover path information in public networks. However, for some routers, traceroute detects their existence but not their ...
113
click to vote
ISCC
2003
IEEE
15 years 11 months ago
2003
IEEE
Multipoint communication — simultaneous transmission from multiple sources to a group of receivers — has numerous applications on Internet. However, the problem is mainly stud...
168
click to vote
PDP
2003
IEEE
15 years 11 months ago
2003
IEEE
We consider the execution of a complex application on a heterogeneous "grid" computing platform. The complex application consists of a suite of identical, independent pr...
125
click to vote
ISPD
1999
ACM
15 years 10 months ago
1999
ACM
- In this paper, we present an algorithm for gate sizing with controlled displacement to improve the overall circuit timing. We use a path-based delay model to capture the timing c...