24368 search results - page 169 / 4874 » Distributed Computing Economics |
110
click to vote
HPCC
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. The distance-2 graph coloring problem aims at partitioning the vertex set of a graph into the fewest sets consisting of vertices pairwise at distance greater than two fro...
130
Voted
WDAG
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
120
click to vote
EUROMICRO
1999
IEEE
15 years 6 months ago
1999
IEEE
Network-centric computing aims to solve the problems associated with traditional client/server systems, namely the high performance requirements, and costly maintenance of, the co...
106
click to vote
FTCS
1993
15 years 3 months ago
1993
Interval availability is a dependability measure defined by the fraction of time during which a system is in operation over a finite observation period. The computation of its d...
108
click to vote
ICC
2009
IEEE
15 years 9 months ago
2009
IEEE
— This paper presents a simple method for computing throughputs of links in a CSMA network. We call our method back-of-the-envelop (BoE) computation, because for many network con...