1612 search results - page 209 / 323 » Analysing Randomized Distributed Algorithms |
111
Voted
INFOCOM
2009
IEEE
15 years 9 months ago
2009
IEEE
Abstract—We investigate the construction of greedy embeddings in polylogarithmic dimensional Euclidian spaces in order to achieve scalable routing through geographic routing. We ...
103
click to vote
INFOCOM
2008
IEEE
15 years 8 months ago
2008
IEEE
— We consider packet transmission scheduling at the MAC-layer via adaptive backoff algorithms that are favorable in terms of queue occupancies in a wireless network. General netw...
91
Voted
ICDCIT
2005
Springer
15 years 8 months ago
2005
Springer
An algorithm for time division multiple access (TDMA) is desirable in sensor networks for energy management, as it allows a sensor to reduce the amount of idle listening. Also, TD...
110
Voted
AINA
2010
IEEE
15 years 7 months ago
2010
IEEE
—Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets...
131
click to vote
COR
2010
15 years 2 months ago
2010
We present a search space analysis and its application in improving local search algorithms for the graph coloring problem. Using a classical distance measure between colorings, w...