85 search results - page 9 / 17 » Distribution sort with randomized cycling |
EGC
2005
Springer
15 years 3 months ago
2005
Springer
The global internet is rich in commodity resources but scarce in specialized resources. We argue that a grid framework can achieve better performance if it separates the management...
MOBIQUITOUS
2007
IEEE
15 years 3 months ago
2007
IEEE
—The skip graph, an application-layer data structure for routing and indexing, may be used in a sensor network to facilitate queries of the distributed k-dimensional data collect...
87
Voted
PPL
2000
14 years 9 months ago
2000
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...
105
click to vote
CPC
2010
14 years 7 months ago
2010
Let G be a fixed connected multigraph with no loops. A random n-lift of G is obtained by replacing each vertex of G by a set of n vertices (where these sets are pairwise disjoint)...
IEEEPACT
2007
IEEE
15 years 3 months ago
2007
IEEE
Distinguishing transient blocks from frequently used blocks enables servicing references to transient blocks from a small fully-associative auxiliary cache structure. By inserting...