2084 search results - page 157 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
133
Voted
AMAI
2008
Springer
15 years 5 months ago
2008
Springer
We study distributed boundary coverage of known environments using a team of miniature robots. Distributed boundary coverage is an instance of the multi-robot task-allocation prob...
154
click to vote
IPPS
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract--In this work, we study the problem of routing packets between undifferentiated sources and sinks in a network modeled by a multigraph. We consider a distributed and local...
136
click to vote
PODC
2005
ACM
15 years 10 months ago
2005
ACM
In this paper we consider the weighted, capacitated vertex cover problem with hard capacities (capVC). Here, we are given an undirected graph G = (V, E), non-negative vertex weigh...
165
click to vote
ICS
2010
Tsinghua U.
15 years 9 months ago
2010
Tsinghua U.
: We study the weight distribution and list-decoding size of Reed-Muller codes. Given a weight parameter, we are interested in bounding the number of Reed-Muller codewords with a w...
118
click to vote
EOR
2008
15 years 5 months ago
2008
We solve an optimal growth model in continuous space, continuous and bounded time. The optimizer chooses the optimal trajectories of capital and consumption across space and time ...