Garey, Michael R. and Johnson, David S., Computing and Intractibility: A Guide to the Theory of NP-Completeness, (W. H. Freeman and Company, 1979). Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
Decision-Theoretic Deliberation Scheduling for Problem Solving.. - Boddy, Dean (1993) (14 citations) (Correct)
....oe of methods which maximizes the probability of achieving the goal by the deadline is straightforward. In the case of an agent faced with multiple goals, even where there is only one method for each goal, optimal choice of a sequence of methods is more difficult. By reducing the knapsack problem [15] to the problem of computing the expected opportunity cost, Etzioni shows that computing the expected opportunity cost of a method is NP complete. 6 The expected opportunity cost of a method is a measure of the benefit that might 6 The knapsack problem involves a set of objects represented by ....
Garey, Michael R. and Johnson, David S., Computing and Intractibility: A Guide to the Theory of NP-Completeness, (W. H. Freeman and Company, 1979).
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