Decision-theoretic troubleshooting: hardness of approximation
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F12%3A00381692" target="_blank" >RIV/67985556:_____/12:00381692 - isvavai.cz</a>
Alternative codes found
RIV/61384399:31160/12:00040158
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Decision-theoretic troubleshooting: hardness of approximation
Original language description
Troubleshooting is one of the application areas of Bayesian networks. Given a probabilistic model of a malfunctioning device, the task is to find the repair strategy with minimal expected cost. Except for simple cases, finding an optimal strategy is NP-hard. We show that optimal troubleshooting strategies are also hard to approximate.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
BC - Theory and management systems
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Proceedings of the Sixth European Workshop on Probabilistic Graphical Models, PGM'12
ISBN
978-84-15536-57-4
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
195-202
Publisher name
DECSAI, University of Granada
Place of publication
Granada
Event location
Granada
Event date
Sep 19, 2012
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—