Scheduling results applicable to decision-theoretic troubleshooting

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985556%3A_____%2F15%3A00431073" target="_blank" >RIV/67985556:_____/15:00431073 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/61384399:31160/15:00045420

Výsledek na webu

<a href="http://dx.doi.org/10.1016/j.ijar.2014.08.004" target="_blank" >http://dx.doi.org/10.1016/j.ijar.2014.08.004</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.ijar.2014.08.004" target="_blank" >10.1016/j.ijar.2014.08.004</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Scheduling results applicable to decision-theoretic troubleshooting

Popis výsledku v původním jazyce

In decision-theoretic troubleshooting, we are given a Bayesian network model of a malfunctioning device and our task is to find a repair strategy with minimal expected cost. The troubleshooting problem has received considerable attention over the past two decades. We show that several troubleshooting scenarios proposed in the literature are equivalent to well-studied machine scheduling problems. This immediately yields new complexity-theoretic and algorithmic results for troubleshooting. We also apply scheduling results to multi-agent troubleshooting. Further, we examine the so-called call service action which is often used in troubleshooting but has no natural counterpart in machine scheduling. We show that adding the call service action to basic troubleshooting models does not make the problem intractable.

Název v anglickém jazyce

Scheduling results applicable to decision-theoretic troubleshooting

Popis výsledku anglicky

In decision-theoretic troubleshooting, we are given a Bayesian network model of a malfunctioning device and our task is to find a repair strategy with minimal expected cost. The troubleshooting problem has received considerable attention over the past two decades. We show that several troubleshooting scenarios proposed in the literature are equivalent to well-studied machine scheduling problems. This immediately yields new complexity-theoretic and algorithmic results for troubleshooting. We also apply scheduling results to multi-agent troubleshooting. Further, we examine the so-called call service action which is often used in troubleshooting but has no natural counterpart in machine scheduling. We show that adding the call service action to basic troubleshooting models does not make the problem intractable.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GA13-20012S" target="_blank" >GA13-20012S: Struktury podmíněné nezávislosti: algebraické a geometrické metody</a><br>

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2015

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

International Journal of Approximate Reasoning

ISSN

0888-613X

e-ISSN

—

Svazek periodika

57

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

20

Strana od-do

87-107

Kód UT WoS článku

000347593900006

EID výsledku v databázi Scopus

—