187 search results - page 7 / 38 » Approximation Algorithms for Multiprocessor Scheduling under... |
IJRR
2010
13 years 6 months ago
2010
Partially observable Markov decision processes (POMDPs) provide a principled, general framework for robot motion planning in uncertain and dynamic environments. They have been app...
IJCAI
2001
13 years 9 months ago
2001
Although a partially observable Markov decision process (POMDP) provides an appealing model for problems of planning under uncertainty, exact algorithms for POMDPs are intractable...
ICALP
2001
Springer
14 years 4 days ago
2001
Springer
Abstract. We consider the scheduling problem of minimizing the average weighted job completion time on a single machine under precedence constraints. We show that this problem with...
IEEEPACT
1997
IEEE
13 years 12 months ago
1997
IEEE
† In this paper, we propose a parallel randomized algorithm, called Parallel Fast Assignment using Search Technique (PFAST), for scheduling parallel programs represented by direc...
ECRTS
2006
IEEE
14 years 1 months ago
2006
IEEE
A polynomial-time algorithm is presented for partitioning a collection of sporadic tasks among the processors of an identical multiprocessor platform with static-priority scheduli...