657 search results - page 106 / 132 » Polynomial Time Algorithms for Minimum Energy Scheduling |
GLOBECOM
2008
IEEE
15 years 6 months ago
2008
IEEE
—Most research works in routing and design of optical networks assume that the optical medium can carry signals without any bit error. However, the physical impairments on the op...
ITNG
2007
IEEE
15 years 6 months ago
2007
IEEE
A block-interchange is a rearrangement event that exchanges two, not necessarily consecutive, contiguous regions in a genome, maintaining the original orientation. Signed reversal...
106
click to vote
ICRA
2006
IEEE
15 years 5 months ago
2006
IEEE
— We study the problem of generating continuous steering control for robots to completely cover a bounded region over a finite time. First, we pack the area by disks of minimum ...
112
click to vote
IPL
2010
14 years 6 months ago
2010
In this paper we initiate the study of a "dynamic" variant of the classical Vertex Cover problem, the Eternal Vertex Cover problem introduced by Klostermeyer and Mynhard...
ISLPED
2009
ACM
15 years 6 months ago
2009
ACM
In an interactive embedded system, special task execution patterns and scheduling constraints exist due to frequent human-computer interactions. This paper proposes a transaction-...