657 search results - page 23 / 132 » Polynomial Time Algorithms for Minimum Energy Scheduling |
INFOCOM
2005
IEEE
15 years 5 months ago
2005
IEEE
Abstract— We develop a dynamic control strategy for minimizing energy expenditure in a time varying wireless network with adaptive transmission rates. The algorithm operates with...
STACS
2004
Springer
15 years 5 months ago
2004
Springer
Motivated by a scheduling problem encountered in multicast environments, we study a vertex labelling problem, called Directed Circular Arrangement (DCA), that requires one to fin...
109
click to vote
SODA
1997
ACM
15 years 1 months ago
1997
ACM
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depe...
95
Voted
RECOMB
2010
Springer
14 years 10 months ago
2010
Springer
We consider the following problem: given a forest of gene family trees on a set of genomes, find a first speciation which splits these genomes into two subsets and minimizes the ...
SIAMCOMP
2010
14 years 6 months ago
2010
Abstract. In this paper we study variants of the non-preemptive parallel job scheduling problem where the number of machines is polynomially bounded in the number of jobs. For this...