1765 search results - page 352 / 353 » Communication Scheduling |
133
Voted
PC
2010
15 years 27 days ago
2010
We consider the computation of shortest paths on Graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of algorithms (such as...
126
Voted
DIALM
2010
ACM
15 years 15 days ago
2010
ACM
We present a method for using real world mobility traces to identify tractable theoretical models for the study of distributed algorithms in mobile networks. We validate the metho...
132
click to vote
MEMOCODE
2010
IEEE
15 years 12 days ago
2010
IEEE
Electronic System Level (ESL) design manages the complexity of todays systems by using abstract models. In this context Transaction Level Modeling (TLM) is state-of-theart for desc...
131
Voted
CORR
2010
Springer
14 years 11 months ago
2010
Springer
We investigate optimal routing and scheduling strategies for multi-hop wireless networks with rateless codes. Rateless codes allow each node of the network to accumulate mutual in...
145
click to vote
CSCW
2011
ACM
14 years 9 months ago
2011
ACM
We conducted interviews with sixteen members of teams that worked across global time zone differences. Despite time zone differences of about eight hours, collaborators still foun...