1578 search results - page 26 / 316 » Direct Routing: Algorithms and Complexity |
COMCOM
2010
13 years 7 months ago
2010
: - To construct a multicast tree is the basis of multicast data transmission. The prime problem concerning the construction of a shared multicast tree is to determine the position...
IPPS
1994
IEEE
14 years 22 days ago
1994
IEEE
This paper describes several algorithms to perform all-to-all communication on a two-dimensional mesh connected computer with wormhole routing. We discuss both direct algorithms, ...
CRYPTO
2007
Springer
14 years 2 months ago
2007
Springer
Coppersmith described at Eurocrypt 96 an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction. A simpler algorithm was later pro...
SIGCOMM
2006
ACM
14 years 2 months ago
2006
ACM
Traditional studies of routing problems often assumed strict preferences on paths, by eliminating ambiguity in path comparisons, or imposing a priori deterministic tie-breaking. S...
ATAL
2007
Springer
14 years 19 days ago
2007
Springer
The dominant existing routing strategies employed in peerto-peer(P2P) based information retrieval(IR) systems are similarity-based approaches. In these approaches, agents depend o...