57 search results - page 2 / 12 » Distributed algorithm for a color assignment on asynchronous... |
WDAG
2007
Springer
13 years 11 months ago
2007
Springer
We consider the problem of minimizing the number of ADMs in optical networks. All previous theoretical studies of this problem dealt with the off-line case, where all the lightpat...
PERCOM
2006
ACM
14 years 4 months ago
2006
ACM
Abstract-- We give efficient sequential and distributed approximation algorithms for strong edge coloring graphs modeling wireless networks. Strong edge coloring is equivalent to c...
IPL
2011
12 years 8 months ago
2011
We propose a probabilistic network model, called asynchronous bounded expected delay (ABE), which requires a known bound on the expected message delay. In ABE networks all asynchr...
INFOCOM
2003
IEEE
13 years 10 months ago
2003
IEEE
— In all-optical networks that use WDM technology it is often the case that several communication requests have to be blocked, due to bandwidth and technology limitations. Minimi...
ECAI
2006
Springer
13 years 9 months ago
2006
Springer
A new search algorithm for solving distributed constraint optimization problems (DisCOPs) is presented. Agents assign variables sequentially and propagate their assignments asynchr...