1095 search results - page 120 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
CPAIOR
2008
Springer
14 years 11 months ago
2008
Springer
The one-step anticipatory algorithm (1s-AA) is an online algorithm making decisions under uncertainty by ignoring future non-anticipativity constraints. It makes near-optimal decis...
ASPDAC
2007
ACM
15 years 1 months ago
2007
ACM
With the emerging process variations in fabrication, the traditional corner-based timing optimization techniques become prohibitive. Buffer insertion is a very useful technique fo...
DAM
2007
14 years 10 months ago
2007
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...
INFOCOM
2009
IEEE
15 years 4 months ago
2009
IEEE
—This paper proposes a VIrtual Scanning Algorithm (VISA), tailored and optimized for road network surveillance. Our design uniquely leverages upon the facts that (i) the movement...
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
Consider the classical online scheduling problem where jobs that arrive one by one are assigned to identical parallel machines with the objective of minimizing the makespan. We gen...