7133 search results - page 365 / 1427 » Communication algorithms with advice |
161
click to vote
APCSAC
2005
IEEE
16 years 11 days ago
2005
IEEE
Abstract. Dynamic data redistribution enhances data locality and improves algorithm performance for numerous scientific problems on distributed memory multi-computers systems. Prev...
180
click to vote
SC
2003
ACM
16 years 9 hour ago
2003
ACM
This paper presents an algorithm for implementing optimal hardware-based multicast trees, on networks that provide hardware support for collective communication. Although the prop...
184
click to vote
IWCMC
2006
ACM
16 years 22 days ago
2006
ACM
One important characteristic of wireless sensor networks is energy stringency. Constructing a connected dominating set (CDS) has been widely used as a topology control strategy to...
165
click to vote
AINA
2010
IEEE
15 years 11 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...
157
click to vote
INFOCOM
2010
IEEE
15 years 5 months ago
2010
IEEE
—We study a mobile wireless network where groups or clusters of nodes are intermittently connected via mobile “carriers” (the carriers provide connectivity over time among di...