358 search results - page 18 / 72 » On the Distributed Complexity of Computing Maximal Matchings |
112
click to vote
ICPADS
1996
IEEE
15 years 6 months ago
1996
IEEE
A new multiagent programmingparadigm based on the transactional logic model' is developed. This paradigm enables us to construct a Distributed agent transactional program (DA...
134
Voted
MAAMAW
1993
Springer
15 years 6 months ago
1993
Springer
Autonomous agents are designed to reach goals that were pre-de ned by their operators. An important way to execute tasks and to maximize payo is to share resources and to cooperate...
122
click to vote
WDAG
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
123
Voted
DCOSS
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
121
Voted
SPAA
2010
ACM
15 years 2 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...