M. Garey. Optimal task scheduling with precedence constraints. Discrete Mathematics, 4, 37-56 (1973). Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Efficient Information Gathering on the Internet.. - Etzioni, Hanks.. (1996) (Correct)
....unbounded parallelism. In addition, in our problem, once an answer is obtained, no other queries need be made. If we constrain the schedules to be sequential, then an optimal solution can be found in polynomial time (see subsection 3. 2 for the LT case) Similar problems havebeen addressed in [4, 13] and elsewhere. The difference in this Objectivefn linear in time time threshold linear in cost LL:minE[S(O) D(O) T (O) LT: max E[S(O) D(O) w reward) s.t. 8O T (O) cost threshold TL:maxE[S(O) T (O) TT: max E[S(O) w reward) s.t. 8O D(O) s.t. 8O D(O) and T (O) cost ....
M. Garey. Optimal task scheduling with precedence constraints. Discrete Mathematics, 4, 37-56 (1973).
Optimal Information Gathering on the Internet with.. - Etzioni, Hanks.. (1996) (6 citations) (Correct)
....consider a number of alternative models that have appeared in the literature, underscoring the difference from our own. If we constrain the policies to be serialized, then an optimal solution can be found in polynomial time (see Section 4 for the LT case) Similar problems have been addressed in [5, 9, 13, 19] and elsewhere. The difference in this paper is the ability to query any number of sources in parallel. 4, 6] study scheduling tasks with unlimited parallelism, but their models are different because all tasks have to be executed successfully, whereas in our model a successful answer from any ....
M. Garey. Optimal task scheduling with precedence constraints. Discrete Mathematics, 4, 37-56 (1973).
Efficient Information Gathering on the Internet.. - Etzioni, Hanks.. (Correct)
....with unbounded parallelism. In addition, in our problem, once an answer is obtained, no other queries need be made. If we constrain the schedules to be sequential, then an optimal solution can be found in polynomial time (see subsection 3. 2 for the LT case) Similar problems have been addressed in [4, 13] and elsewhere. The difference in this Objective fn linear in time time threshold linear in cost LL: min E[S(O) Gamma D(O) Gamma T (O) LT: max E[S(O) Gamma D(O) w reward) s.t. 8O T (O) cost threshold TL: max E[S(O) Gamma T (O) TT: max E[S(O) w reward) s.t. 8O D(O) s.t. 8O ....
M. Garey. Optimal task scheduling with precedence constraints. Discrete Mathematics, 4, 37-56 (1973).
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC