73 search results - page 8 / 15 » Efficient Connectivity Testing of Hypercubic Networks with F... |
ICDCS
1991
IEEE
13 years 10 months ago
1991
IEEE
of ‘‘network computers’’ is inherently lessAbstract predictable than that of more traditional distributed memory systems, such as hypercubes [22], since both theFor computa...
ESANN
2008
13 years 8 months ago
2008
We test a selection of associative memory models built with different connection strategies, exploring the relationship between the structural properties of each network and its pa...
CN
2006
13 years 6 months ago
2006
Measurement studies indicate a high rate of node dynamics in p2p systems. In this paper, we address the question of how high a rate of node dynamics can be supported by structured...
AINA
2004
IEEE
13 years 10 months ago
2004
IEEE
Peer-to-peer (P2P) computing offers many attractive features, such as self-organization, load-balancing, availability, fault tolerance, and anonymity. However, it also faces some ...
JNW
2006
13 years 6 months ago
2006
A number of Integer Linear Program (ILP) formulations for both static and dynamic lightpath allocation have been proposed, for the design of survivable WDM networks. However, such ...