2714 search results - page 63 / 543 » Approximation Schemes for Scheduling |
132
click to vote
ICPP
2002
IEEE
15 years 5 months ago
2002
IEEE
In this paper, we investigate an efficient off-line scheduling algorithm in which real-time tasks with precedence constraints are executed in a heterogeneous environment. It provi...
107
Voted
AAAI
2007
15 years 2 months ago
2007
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
RTAS
2010
IEEE
14 years 11 months ago
2010
IEEE
—The problem of scheduling a set of tasks on a multiprocessor architecture is addressed. Tasks are assumed to be sporadic with arbitrary deadlines and may migrate between process...
130
Voted
UAI
2000
15 years 1 months ago
2000
We consider the problem belief-state monitoring for the purposes of implementing a policy for a partially-observable Markov decision process (POMDP), specifically how one might ap...
119
Voted
ICC
2008
IEEE
15 years 7 months ago
2008
IEEE
— Designing switching architectures for network routers and switches needs to consider limits imposed by the electronic technology, like small bandwidth×distance factors, power ...