<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="C">   <ARLID>0360899</ARLID> <utime>20240103195326.6</utime><mtime>20110829235959.9</mtime>         <title language="eng" primary="1">Extensions of Decision-Theoretic Troubleshooting: Cost Clusters and Precedence Constraints</title>  <specification> <page_count>11 s.</page_count> </specification>   <serial><ARLID>cav_un_epca*0363001</ARLID><ISBN>978-3-642-22151-4</ISBN><ISSN>0302-9743</ISSN><title>Symbolic and Quantitative Approaches to Reasoning with Uncertainty</title><part_num/><part_title/><page_num>206-216</page_num><publisher><place>Heidelberg</place><name>Springer</name><year>2011</year></publisher><editor><name1>Liu</name1><name2>W.</name2></editor></serial>    <keyword>Computational Complexity</keyword>   <keyword>Decision-Theoretic Troubleshooting</keyword>   <keyword>Scheduling</keyword>    <author primary="1"> <ARLID>cav_un_auth*0272969</ARLID> <name1>Lín</name1> <name2>Václav</name2> <full_dept language="cz">Matematická teorie rozhodování</full_dept> <full_dept language="eng">Department of Decision Making Theory</full_dept> <department language="cz">MTR</department> <department language="eng">MTR</department> <institution>UTIA-B</institution> <full_dept>Department of Decision Making Theory</full_dept>  <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author>   <source> <url>http://library.utia.cas.cz/separaty/2011/MTR/lin-extensions of decision-theoretic troubleshooting cost clusters and precedence constraints.pdf</url> </source>        <cas_special> <project> <project_id>1M0572</project_id> <agency>GA MŠk</agency> <country>CZ</country> <ARLID>cav_un_auth*0001814</ARLID> </project> <project> <project_id>GEICC/08/E010</project_id> <agency>GA ČR</agency> <ARLID>cav_un_auth*0241637</ARLID> </project> <research> <research_id>CEZ:AV0Z10750506</research_id> </research>  <abstract language="eng" primary="1">In decision-theoretic troubleshooting, we try to find a cost efficient repair strategy for a malfunctioning device described by a formal model. The need to schedule repair actions under uncertainty  has required the researchers to use an appropriate knowledge representation  formalism, often a probabilistic one. We show that two troubleshooting scenarios — Troubleshooting with Postponed System Test and Troubleshooting with Cost Clusters without Inside Information —are NP-hard. Also, we define a troubleshooting scenario with precedence restrictions on the repair actions.</abstract>  <action target="WRD"> <ARLID>cav_un_auth*0272970</ARLID> <name>Symbolic and Quantitative Approaches to Reasoning with Uncertainty 11th European Conference</name> <place>Belfast</place> <dates>29.06.2011-01.07.2011</dates>  <country>GB</country> </action>    <reportyear>2012</reportyear>  <RIV>IN</RIV>      <num_of_auth>1</num_of_auth>   <permalink>http://hdl.handle.net/11104/0198342</permalink>         <unknown tag="mrcbT16-q">100</unknown> <unknown tag="mrcbT16-s">0.336</unknown> <unknown tag="mrcbT16-y">16.35</unknown> <unknown tag="mrcbT16-x">0.4</unknown> <arlyear>2011</arlyear>       <unknown tag="mrcbU63"> cav_un_epca*0363001 Symbolic and Quantitative Approaches to Reasoning with Uncertainty 978-3-642-22151-4 0302-9743 206 216 Heidelberg Springer 2011 Lecture Notes in Artificial Intelligence 6717 </unknown> <unknown tag="mrcbU67"> Liu W. 340 </unknown> </cas_special> </bibitem>