1095 search results - page 58 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
80
Voted
IPPS
2007
IEEE
15 years 4 months ago
2007
IEEE
The general approach to fault tolerance in uniprocessor systems is to maintain enough time redundancy in the schedule so that any task instance can be re-executed in presence of f...
80
Voted
ICCAD
2004
IEEE
15 years 7 months ago
2004
IEEE
Traditional timing-driven placement considers only combinational delays and does not take into account the potential of subsequent sequential optimization steps. As a result, the ...
81
Voted
ESA
2000
Springer
15 years 1 months ago
2000
Springer
The p-center problem is to locate p facilities on a network so as to minimize the largest distance from a demand point to its nearest facility. The p-median problem is to locate p ...
76
Voted
KDD
2003
ACM
15 years 10 months ago
2003
ACM
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
116
click to vote
RTSS
2005
IEEE
15 years 3 months ago
2005
IEEE
Abstract— Dynamic voltage scaling (DVS) is a promising technique for battery-powered systems to conserve energy consumption. Most existing DVS algorithms assume information about...