358 search results - page 43 / 72 » On the Distributed Complexity of Computing Maximal Matchings |
104
click to vote
IPPS
2000
IEEE
15 years 6 months ago
2000
IEEE
This paper is on the Consensus problem, in the context of asynchronous distributed systems made of n processes, at most f of them may crash. A family of failure detector classes s...
145
click to vote
MOBIHOC
2009
ACM
15 years 8 months ago
2009
ACM
Spectrum is a critical yet scarce resource and it has been shown that dynamic spectrum access can significantly improve spectrum utilization. To achieve this, it is important to ...
102
click to vote
EUROPAR
2003
Springer
15 years 7 months ago
2003
Springer
Efficient discovery and resource allocation is one of the challenges of current Peer-to-Peer systems. In centralized approaches, the user requests can be matched to the fastest, ch...
122
click to vote
JGAA
2000
15 years 1 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
133
click to vote
HPDC
2008
IEEE
15 years 8 months ago
2008
IEEE
If the model of free-form queries, which has proved successful for HTML based search on the Web, is made available for Grid services, it will serve as a powerful tool for scientis...