358 search results - page 45 / 72 » On the Distributed Complexity of Computing Maximal Matchings |
110
click to vote
EUROPAR
2010
Springer
15 years 3 months ago
2010
Springer
Ants provide an attractive metaphor for robots that "cooperate" in performing complex tasks. What, however, are the algorithmic consequences of following this metaphor? ...
119
Voted
SIGCOMM
2003
ACM
15 years 7 months ago
2003
ACM
This paper presents an algorithm for content-based forwarding, an essential function in content-based networking. Unlike in traditional address-based unicast or multicast networks...
120
click to vote
SIGECOM
2003
ACM
15 years 7 months ago
2003
ACM
We consider the problem of designing fast and strategyproof exchanges for dynamic resource allocation problems in distributed systems. The exchange is implemented as a sequence of...
ALIFE
2006
15 years 2 months ago
2006
We present a new bio-inspired approach applied to a problem of stereo image matching. This approach is based on an artificial epidemic process, which we call the infection algorith...
129
click to vote
ICPP
2002
IEEE
15 years 6 months ago
2002
IEEE
A cost-effective approach to building up scalable Videoon-Demand (VoD) servers is to couple a number of VoD servers together in a cluster. In this article, we study a crucial vide...