3919 search results - page 223 / 784 » Modelling Dynamic Forgetting in Distributed Information Syst... |
151
click to vote
ICDCS
2003
IEEE
15 years 11 months ago
2003
IEEE
In a system proposed by Plaxton, Rajaraman and Richa (PRR), the expected cost of accessing a replicated object was proved to be asymptotically optimal for a static set of nodes an...
174
click to vote
LCPC
2000
Springer
15 years 10 months ago
2000
Springer
State-of-the-art run-time systems are a poor match to diverse, dynamic distributed applications because they are designed to provide support to a wide variety of applications, with...
171
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
Service-oriented systems are becoming more and more nodes in a digital, dynamic ecosystem requiring the identification and establishment of flexible, spontaneous collaboration act...
178
click to vote
NAS
2010
IEEE
15 years 5 months ago
2010
IEEE
—In greedy routing, each relay node forwards the message to a neighbor (also called successor) that is closer to the destination. However, the successor candidate set (SCS) is di...
159
click to vote
COMSWARE
2007
IEEE
16 years 26 days ago
2007
IEEE
Abstract— Minimizing the energy cost and improving thermal performance of power-limited datacenters, deploying large computing clusters, are the key issues towards optimizing the...