200 search results - page 33 / 40 » On the decidability of phase ordering problem in optimizing ... |
PC
2007
13 years 7 months ago
2007
We explore runtime mechanisms and policies for scheduling dynamic multi-grain parallelism on heterogeneous multi-core processors. Heterogeneous multi-core processors integrate con...
INFOCOM
1991
IEEE
13 years 11 months ago
1991
IEEE
customer which exceeds its deadline will either leave the queue without service or stay in the queue to get unsucWe consider the problem of scheduling impatient CUS- cessful servic...
EVOW
2007
Springer
14 years 1 months ago
2007
Springer
Many instances of NP-hard problems can be solved efficiently if the treewidth of their corresponding graph is small. Finding the optimal tree decompositions is an NP-hard problem a...
AIPS
2008
13 years 9 months ago
2008
In the planning-as-SAT paradigm there have been numerous recent developments towards improving the speed and scalability of planning at the cost of finding a step-optimal parallel...
LCTRTS
2005
Springer
14 years 29 days ago
2005
Springer
Dictionary compression mechanisms identify redundant sequences of instructions that occur in a program. The sequences are extracted and copied to a dictionary. Each sequence is th...