A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
Complexity of the Exact Solution to the Test Sequencing Problem
2015
Conference on Uncertainty in Artificial Intelligence
Consider a doctor choosing a treatment for an uncertain disorder for which there are n costly tests available. Based on the test results observed so far, the doctor can either order another test or proceed to the treatment decision. Although test sequencing is a problem that arises frequently in many decision situations, finding an exact solution is NP-hard with respect to n. In this paper, we analyze the time complexity of classic symmetric and asymmetric formulations, using influence diagrams
dblp:conf/uai/LiuS15
fatcat:23bzgh7itzf2xnrfe4iqg2fyyu