657 search results - page 7 / 132 » Polynomial Time Algorithms for Minimum Energy Scheduling |
100
click to vote
JCO
2010
14 years 10 months ago
2010
The following planar minimum disk cover problem is considered in this paper: given a set D of n disks and a set P of m points in the Euclidean plane, where each disk covers a subse...
104
click to vote
SODA
1998
ACM
15 years 1 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
110
click to vote
WIOPT
2005
IEEE
15 years 5 months ago
2005
IEEE
We consider the problem of transmission scheduling of data over a wireless fading channel with hard deadline constraints. Our system consists of N users, each with a fixed amount...
106
click to vote
RTAS
2003
IEEE
15 years 4 months ago
2003
IEEE
This paper addresses the scheduling problem of radar dwells in multi-function phase array radars. Well-known and new challenges make it difficult to provide predictable performan...
CCCG
2007
15 years 1 months ago
2007
Given a rectangular boundary partitioned into rectangles, the MLC-R problem is to find a Minimum EdgeLength Corridor that visits at least one point from the boundary of every rec...