利用内部信息排除成本集群的成本
The Cost of Troubleshooting Cost Clusters with Inside Information
摘要:
决策理论故障排除是关于最小化解决某个问题的预期成本,例如修理复杂的人造设备。在本文中,我们考虑的情况下,你必须拆开一些设备,以获得某些集群和行动。具体来说,我们调查故障排除与独立的行动在树的集群,集群内的行动无法执行之前,集群被打开。这个问题并不简单,因为打开和关闭一个集群都有成本。在O(n)的时间内解决独立操作和无簇的故障排除(n是动作的数量)通过由Kadane和Simon提出的众所周知的“P-over-C”算法,本文描述了一个“自底向上的P-over-C”O(nlgn)算法,该算法的时间复杂度为O(nlgn)时间算法,并表明它是最佳的,当集群不需要关闭,以测试是否解决问题的行动。
英文摘要:
Decision theoretical troubleshooting is about minimizing the expected cost of solving a certain problem like repairing a complicated man-made device. In this paper we consider situations where you have to take apart some of the device to get access to certain clusters and actions. Specifically, we investigate troubleshooting with independent actions in a tree of clusters where actions inside a cluster cannot be performed before the cluster is opened. The problem is non-trivial because there is a cost associated with opening and closing a cluster. Troubleshooting with independent actions and no clusters can be solved in O(n lg n) time (n being the number of actions) by the well-known "P-over-C" algorithm due to Kadane and Simon, but an efficient and optimal algorithm for a tree cluster model has not yet been found. In this paper we describe a "bottom-up P-over-C" O(n lg n) time algorithm and show that it is optimal when the clusters do not need to be closed to test whether the actions solved the problem.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。