1783 search results - page 267 / 357 » Low-Complexity Distributed Scheduling Algorithms for Wireles... |
168
click to vote
TPDS
2008
15 years 5 months ago
2008
Recent technological advances have opened up a wide range of distributed real-time applications involving battery-driven embedded devices with local processing and wireless communi...
177
Voted
ICS
2007
Tsinghua U.
15 years 11 months ago
2007
Tsinghua U.
Grid Workflows are emerging as practical programming models for solving large e-scientific problems on the Grid. However, it is typically assumed that the workflow components eith...
170
click to vote
IPPS
2003
IEEE
15 years 10 months ago
2003
IEEE
In this paper we investigate protocols for scheduling applications that consist of large numbers of identical, independent tasks on large-scale computing platforms. By imposing a ...
135
click to vote
COMCOM
2010
15 years 3 months ago
2010
—In this paper, we study the trade-off between network throughput and fairness in a multi-channel enabled WSN. Traditional approaches attempt to solve the two problems in an isol...
152
click to vote
PERCOM
2004
ACM
16 years 4 months ago
2004
ACM
We investigate the theoretical limits of positioning algorithms. In particular, we study scenarios where the nodes do not receive anchors directly (multi-hop) and where no physica...