10106 search results - page 74 / 2022 » Algorithm Selection and Scheduling |
96
Voted
CP
1997
Springer
15 years 4 months ago
1997
Springer
A number of pitfalls of empirical scheduling research are illustrated using real experimental data. These pitfalls, in general, serve to slow the progress of scheduling research b...
137
Voted
CCGRID
2008
IEEE
15 years 2 months ago
2008
IEEE
In this article, we revisit the problem of scheduling dynamically generated directed acyclic graphs (DAGs) of multi-processor tasks (M-tasks). A DAG is a basic model for expressin...
203
click to vote
IIS
2004
15 years 1 months ago
2004
Learning algorithms, as NN or C4.5 require adequate sets of examples. In the paper we present the usability of genetic algorithms for selection significant features. Fitness of ind...
112
click to vote
WDAG
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. Weak fairness guarantees that if an action is continuously enabled, it is executed infinitely often. Strong fairness, on the other hand, guarantees that actions that are...
72
Voted
CCGRID
2009
IEEE
15 years 7 months ago
2009
IEEE
We describe our experiences from implementing and integrating a new job scheduling algorithm in the gLite Grid middleware and present experimental results that compare it to the e...