1257 search results - page 173 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
115
click to vote
GLOBECOM
2008
IEEE
15 years 4 months ago
2008
IEEE
Abstract—In this paper, we investigate and analyze the expected per-node throughput in a wireless sensor network under a randomized sleep scheduling framework with a connectivity...
ICPP
2003
IEEE
15 years 3 months ago
2003
IEEE
In reservation-based packet scheduling algorithms for single-hop WDM networks, one of the wavelengths is used as a control channel which is shared by all of the nodes for transmit...
SPAA
2003
ACM
15 years 3 months ago
2003
ACM
In this paper we consider the following scenario. A set of n jobs with different threads is being run concurrently. Each job has an associated weight, which gives the proportion ...
MST
2000
14 years 9 months ago
2000
We consider the problem of processing a given number of tasks on a given number of processors as quickly as possible when only vague information about the processing time of a task...
MM
2004
ACM
15 years 3 months ago
2004
ACM
This paper presents the design, implementation, and evaluation of a practical voltage scaling (PDVS) algorithm for mobile devices primarily running multimedia applications. PDVS s...