1015 search results - page 7 / 203 » An efficient algorithm for AS path inferring |
136
Voted
CGI
2004
IEEE
15 years 9 months ago
2004
IEEE
We give an efficient, scalable, and simple algorithm for computation of a central path for navigation in closed virtual environments. The algorithm requires less preprocessing and...
159
click to vote
SEBD
1996
15 years 6 months ago
1996
Abstract. To select an optimal query evaluation strategy for a path query in an object-oriented database system one has to exploit the available index structures on the path. In a ...
186
click to vote
AAIM
2007
Springer
15 years 9 months ago
2007
Springer
Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectiv...
120
Voted
TCAD
2008
15 years 5 months ago
2008
Abstract--The electrostatic discharge (ESD) problem has become a challenging reliability issue in nanometer-circuit design. High voltages that resulted from ESD might cause high cu...
156
click to vote
CONPAR
1992
15 years 9 months ago
1992
The algorithm designed in [12, 15] was the very first distributed algorithm to solve the mutual exclusion problem in complete networks by using a dynamic logical tree structure as...