1095 search results - page 202 / 219 » Efficient Algorithms for Average Completion Time Scheduling |
LCTRTS
2010
Springer
15 years 4 months ago
2010
Springer
Coarse Grain Reconfigurable Architectures (CGRAs) promise high performance at high power efficiency. They fulfil this promise by keeping the hardware extremely simple, and movi...
WWW
2010
ACM
15 years 4 months ago
2010
ACM
In modern Web applications, style formatting and layout calculation often account for a substantial amount of local Web page processing time. In this paper1 , we present two novel...
MOR
2008
14 years 9 months ago
2008
The flow set with partial order is a mixed-integer set described by a budget on total flow and a partial order on the arcs that may carry positive flow. This set is a common substr...
ISSTA
2009
ACM
15 years 4 months ago
2009
ACM
Exception analysis and points-to analysis are typically done in complete separation. Past algorithms for precise exception analysis (e.g., pairing throw clauses with catch stateme...
ICML
2006
IEEE
15 years 10 months ago
2006
IEEE
The Viterbi algorithm is an efficient and optimal method for decoding linear-chain Markov Models. However, the entire input sequence must be observed before the labels for any tim...