1594 search results - page 141 / 319 » An Algorithm to Compute Collusion Paths |
134
click to vote
CCGRID
2004
IEEE
15 years 7 months ago
2004
IEEE
Distributed Hash Tables (DHTs) bring the promise of increased availability of data to wide-area systems, under the assumption of uniform request load. However, they don't int...
112
click to vote
CONEXT
2008
ACM
15 years 5 months ago
2008
ACM
Today's Internet's routing paths are inefficient with respect to both connectivity and the market for interconnection. The former manifests itself via needlessly long pa...
142
click to vote
ICDCS
2010
IEEE
2010
IEEE
Distributed Construction of Connected Dominating Sets with Minimum Routing Cost in Wireless Networks
15 years 3 months ago
—In this paper, we will study a special Connected Dominating Set (CDS) problem — between any two nodes in a network, there exists at least one shortest path, all of whose inter...
155
click to vote
APSCC
2009
IEEE
15 years 10 months ago
2009
IEEE
What is a cloud application precisely? In this paper, we formulate a computing cloud as a kind of graph, a computing resource such as services or intellectual property access righ...
146
Voted
IPPS
2000
IEEE
15 years 7 months ago
2000
IEEE
Dynamic, distributed, real-time systems control an environment that varies widely without any time-invariant statistical or deterministic characteristic, are spread across multiple...