M. Henig and D. Simchi-Levy.Scheduling tasks with failure probabilities to minimize expected cost. Naval Research Logistics 37,99-109, 1990. 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)
....; T (O) TT: max E[S(O) w reward) s.t. 8O D(O) s.t. 8O D(O) and T (O) cost linear (no reward) CO: min E[D(O) T (O) Figure 1: The five objective functions. O denotes a possible outcome of the schedule P to be found. paper is the ability to query anynumber of sources in parallel. [3, 5] study scheduling tasks with unlimited parallelism with some similarity to the LL and CO models, but the positive results in [3, 5] are limited to an exponential time dynamic programming algorithm and some heuristics. 2 The Cost Model 2.1 BatchSchedules for a Single Item of Information Issuing ....
....Figure 1: The five objective functions. O denotes a possible outcome of the schedule P to be found. paper is the ability to query anynumber of sources in parallel. 3, 5] study scheduling tasks with unlimited parallelism with some similarity to the LL and CO models, but the positive results in [3, 5] are limited to an exponential time dynamic programming algorithm and some heuristics. 2 The Cost Model 2.1 BatchSchedules for a Single Item of Information Issuing the query to information source i is referred to as performing job i.We define a mathematical notion called a fraction of a job, or ....
M. Henig and D. Simchi-Levy.Scheduling tasks with failure probabilities to minimize expected cost. Naval Research Logistics 37,99-109, 1990.
Optimal Information Gathering on the Internet with.. - Etzioni, Hanks.. (1996) (6 citations) (Correct)
....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 single source suffices. Furthermore, the positive results in [4, 6] are restricted to an exponential time dynamic ....
....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 single source suffices. Furthermore, the positive results in [4, 6] are restricted to an exponential time dynamic programming algorithm and some heuristics. Another model of optimal information gathering has recently been studied in [3] There, the objective is to find a query policy that minimizes the expected value of a linear combination of the total dollar ....
M. Henig and D. Simchi-Levy. Scheduling tasks with failure probabilities to minimize expected cost. Naval Research Logistics 37,99-109, 1990.
Efficient Information Gathering on the Internet.. - Etzioni, Hanks.. (Correct)
....T (O) TT: max E[S(O) w reward) s.t. 8O D(O) s.t. 8O D(O) and T (O) cost linear (no reward) CO: min E[D(O) T (O) Figure 1: The five objective functions. O denotes a possible outcome of the schedule P to be found. paper is the ability to query any number of sources in parallel. [3, 5] study scheduling tasks with unlimited parallelism with some similarity to the LL and CO models, but the positive results in [3, 5] are limited to an exponential time dynamic programming algorithm and some heuristics. 2 The Cost Model 2.1 Batch Schedules for a Single Item of Information Issuing ....
....Figure 1: The five objective functions. O denotes a possible outcome of the schedule P to be found. paper is the ability to query any number of sources in parallel. 3, 5] study scheduling tasks with unlimited parallelism with some similarity to the LL and CO models, but the positive results in [3, 5] are limited to an exponential time dynamic programming algorithm and some heuristics. 2 The Cost Model 2.1 Batch Schedules for a Single Item of Information Issuing the query to information source i is referred to as performing job i. We define a mathematical notion called a fraction of a job, ....
M. Henig and D. Simchi-Levy. Scheduling tasks with failure probabilities to minimize expected cost. Naval Research Logistics 37,99-109, 1990.
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