435 search results - page 14 / 87 » On necessary conditions for scale-freedom in complex network... |
SPAA
2004
ACM
14 years 23 days ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
EUC
2004
Springer
14 years 22 days ago
2004
Springer
Communication optimization plays an important role in building networked distributed applications. In this paper, we systematically evaluate four bandwidth reduction algorithms, n...
SCCC
1998
IEEE
13 years 11 months ago
1998
IEEE
Software architectural design is essential for complex distributed applications. Architectural specifications need to define the key aspects of the application, including its inte...
SPAA
2009
ACM
14 years 8 months ago
2009
ACM
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...
NOMS
2010
IEEE
13 years 5 months ago
2010
IEEE
Abstract— Today’s networked systems are extensively instrumented for collecting a wealth of monitoring data. In this paper, we propose a framework called System-wide Similarity...