511 search results - page 74 / 103 » Lower bounds for distributed markov chain problems |
DM
2008
13 years 7 months ago
2008
In edge colouring it is often useful to have information about the degree distribution of the neighbours of a given vertex. For example, the well known Vizing's Adjacency Lem...
STACS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The dynamic page migration problem [4] is defined in a distributed network of n mobile nodes sharing one indivisible memory page of size D. During runtime, the nodes can...
AMAI
2008
Springer
13 years 8 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...
TPDS
2010
13 years 6 months ago
2010
Abstract—In the past few years, P2P file distribution applications (e.g., BitTorrent) are becoming so popular that they are the dominating source of Internet traffic. This crea...
TMC
2010
13 years 6 months ago
2010
—One important application of cooperative communications is to extend coverage area in wireless networks without increasing infrastructure. However, a crucial challenge in implem...