342 search results - page 10 / 69 » Automatic Generation of Heuristics for Scheduling |
113
click to vote
ASAP
2010
IEEE
15 years 19 days ago
2010
IEEE
Abstract--Polynomial approximation is a very general technique for the evaluation of a wide class of numerical functions of one variable. This article details an architecture gener...
NIPS
1997
15 years 12 days ago
1997
Program execution speed on modern computers is sensitive, by a factor of two or more, to the order in which instructions are presented to the processor. To realize potential execu...
HCW
2000
IEEE
15 years 3 months ago
2000
IEEE
A heuristic algorithm that maps data-processing tasks onto heterogeneous resources (i.e., processors and links of various capacities) is presented. The algorithm tries to achieve ...
EOR
2006
14 years 11 months ago
2006
We consider the problem of partitioning a set of positive integers values into a given number of subsets, each having an associated cardinality limit, so that the maximum sum of v...
105
click to vote
CP
2004
Springer
15 years 4 months ago
2004
Springer
This paper considers the problem of transforming a resource feasible, fixed-times schedule into a partial order schedule (POS) to enhance its robustness and stability properties. ...