657 search results - page 54 / 132 » Polynomial Time Algorithms for Minimum Energy Scheduling |
CCGRID
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper we present a multicost algorithm for the joint time scheduling of the communication and computation resources that will be used by a task. The proposed algorithm sel...
WG
2007
Springer
15 years 6 months ago
2007
Springer
The pathwidth of a graph G is the minimum clique number of H minus one, over all interval supergraphs H of G. Although pathwidth is a well-known and well-studied graph parameter, t...
EUROPAR
2010
Springer
15 years 6 hour ago
2010
Springer
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...
118
click to vote
FSKD
2005
Springer
15 years 5 months ago
2005
Springer
Core operations (e.g. TDMA scheduler, synchronized sleep period, data aggregation) of many proposed protocols for different layer of sensor network necessitate clock synchronizatio...
WIOPT
2010
IEEE
14 years 10 months ago
2010
IEEE
—In this paper, we explore physical layer cooperative communication in order to design network layer routing algorithms that are energy efficient. We assume each node in the net...