10106 search results - page 172 / 2022 » Algorithm Selection and Scheduling |
157
click to vote
SIAMCOMP
2010
15 years 1 months ago
2010
Abstract. In this paper we study variants of the non-preemptive parallel job scheduling problem where the number of machines is polynomially bounded in the number of jobs. For this...
258
click to vote
TOG
2012
13 years 9 months ago
2012
Using existing programming tools, writing high-performance image processing code requires sacrificing readability, portability, and modularity. We argue that this is a consequenc...
166
click to vote
IPPS
1996
IEEE
15 years 10 months ago
1996
IEEE
A common statistical problem is that of nding the median element in a set of data. This paper presents a fastand portable parallel algorithm for nding the median given a set of el...
202
click to vote
AAAI
2012
13 years 8 months ago
2012
Kernel methods have been successfully applied to many machine learning problems. Nevertheless, since the performance of kernel methods depends heavily on the type of kernels being...
168
Voted
SODA
2010
ACM
16 years 3 months ago
2010
ACM
We investigate the preemptive scheduling of periodic tasks with hard deadlines. We show that, even in the uniprocessor case, no polynomial time algorithm can test the feasibility ...