874 search results - page 75 / 175 » Practical Algorithms for Selection on Coarse-Grained Paralle... |
AAAI
2010
13 years 10 months ago
2010
The precise specification of reward functions for Markov decision processes (MDPs) is often extremely difficult, motivating research into both reward elicitation and the robust so...
SKG
2005
IEEE
14 years 2 months ago
2005
IEEE
Efficient task scheduling is critical to achieving high performance on grid computing environment. A heuristic task scheduling algorithm satisfied resources load balancing on grid ...
PPOPP
2010
ACM
14 years 3 months ago
2010
ACM
In processors with several levels of hardware resource sharing, like CMPs in which each core is an SMT, the scheduling process becomes more complex than in processors with a singl...
GCC
2006
Springer
14 years 21 days ago
2006
Springer
In this paper, we propose a new scheduling algorithm with economic theory, called Black Scholes Market (BSM) algorithm for a class of Dynamic Jobs (DJ). BSM is based on the classi...
ICPPW
2002
IEEE
14 years 2 months ago
2002
IEEE
The effectiveness of the memory hierarchy is critical for the performance of current processors. The performance of the memory hierarchy can be improved by means of program transf...