7133 search results - page 257 / 1427 » Communication algorithms with advice |
178
click to vote
SIROCCO
2008
15 years 8 months ago
2008
In this paper, we consider the clustering of resources on large scale platforms. More precisely, we target parallel applications consisting of independant tasks, where each task is...
177
click to vote
COR
2007
15 years 6 months ago
2007
A new problem encoding is devised for the minimum span frequency assignment problem in wireless communications networks which is compact and general. Using the new encoding, which...
184
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
– Redundant sensing capabilities are often required in sensor network applications due to various reasons, e.g. robustness, fault tolerance, or increased accuracy. At the same ti...
160
click to vote
JGAA
2006
15 years 6 months ago
2006
Three classes of graphs, simplicial, upper bound, and middle graphs, have been known for some time, but many of their algorithmic properties have not been published. The definitio...
180
click to vote
PC
2002
15 years 6 months ago
2002
We present a new parallel algorithm to compute an exact triangularization of large square or rectangular and dense or sparse matrices in any field. Using fast matrix multiplicatio...