1594 search results - page 71 / 319 » An Algorithm to Compute Collusion Paths |
126
click to vote
ICDCSW
2006
IEEE
15 years 9 months ago
2006
IEEE
In this paper we present a gossip based protocol for path discovery in Mobile Ad Hoc Networks (MANETs). While in the classical gossip algorithm each node forwards a packet with th...
122
click to vote
IPPS
2006
IEEE
15 years 9 months ago
2006
IEEE
The hierarchical hypercube network is suitable for massively parallel systems. An appealing property of this network is the low number of connections per processor, which can faci...
128
click to vote
DAC
1996
ACM
15 years 7 months ago
1996
ACM
We propose a low-overhead scan design methodology which employs a new test point insertion technique to establish scan paths through the functional logic. The technique re-uses th...
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. Let G be a directed planar graph of complexity n, each arc having a nonnegative length. Let s and t be two distinct faces of G; let s1, . . . , sk be vertices incident wi...
148
click to vote
COCOON
1999
Springer
15 years 7 months ago
1999
Springer
We present results related to satisfying shortest path queries on a planar graph stored in external memory. Let N denote the number of vertices in the graph and let sort(N) denote...