Complexity of decision-theoretic troubleshooting

DOI10.1002/INT.10087MaRDI QIDQ4416292zbMATH OpenOpenAlexFDO

Authors Marta Vomlelová

Publication date 31 July 2003

Published in International Journal of Intelligent Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/int.10087

zbMATH Keywords

troubleshooting models

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• Decision-theoretic troubleshooting: hardness of approximation
• Extensions of Decision-Theoretic Troubleshooting: Cost Clusters and Precedence Constraints
• Scheduling results applicable to decision-theoretic troubleshooting
• Troubleshooting: NP-hardness and solution methods
• Troubleshooting using probabilistic networks and value of information

Cites work

• scientific article; zbMATH DE number 2102754 (Why is no real title available?)
• Risk-sensitive decision-theoretic diagnosis
• The complexity of the travelling repairman problem
• The SACSO methodology for troubleshooting complex systems

Cited in

(9)

• Troubleshooting using probabilistic networks and value of information
• Troubleshooting: NP-hardness and solution methods
• Batch repair actions for automated troubleshooting
• Decision-theoretic troubleshooting: hardness of approximation
• The SACSO methodology for troubleshooting complex systems
• Extensions of Decision-Theoretic Troubleshooting: Cost Clusters and Precedence Constraints
• Optimal probe selection in diagnostic search
• Scheduling results applicable to decision-theoretic troubleshooting
• scientific article; zbMATH DE number 1844466 (Why is no real title available?)

This page was built for publication: Complexity of decision-theoretic troubleshooting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4416292)