메뉴 건너뛰기




Volumn 7, Issue 5, 2003, Pages 357-368

Troubleshooting: NP-hardness and solution methods

Author keywords

Bayesian networks; Computational complexity; Decision theoretic troubleshooting

Indexed keywords

CONDITIONAL INDEPENDENCES; DECISION-THEORETIC; DEPTH FIRST SEARCH ALGORITHMS; EXPECTED COSTS; HEURISTIC FUNCTIONS; LOWER BOUNDS; NP-HARDNESS; SOLUTION METHODS;

EID: 9744220052     PISSN: 14327643     EISSN: 14337479     Source Type: Journal    
DOI: 10.1007/s00500-002-0224-4     Document Type: Article
Times cited : (24)

References (12)
  • 5
    • 0001554685 scopus 로고
    • A Comparison of decision analyais and expert rules for sequential analysis
    • In: Besnard P, Hanks S (eds), New York
    • Kalagnanam J, Henrion M (1988) A Comparison of decision analyais and expert rules for sequential analysis. In: Besnard P, Hanks S (eds) The Fourth Conference on Uncertainty in Artificial Intelligence, pp. 271-281, New York
    • (1988) The Fourth Conference on Uncertainty in Artificial Intelligence , pp. 271-281
    • Kalagnanam, J.1    Henrion, M.2
  • 10
    • 0002825967 scopus 로고
    • A polynomial algorithm for computing the optimal repair strategy in a system with independent component failures
    • In, Montréal, Canada
    • Srinivas S (1995) A polynomial algorithm for computing the optimal repair strategy in a system with independent component failures. In: Proc. of the Eleventh Conference on Uncertainty in Artificial Intelligence, pp. 515-522, Montréal, Canada
    • (1995) Proc. of the Eleventh Conference on Uncertainty in Artificial Intelligence , pp. 515-522
    • Srinivas, S.1
  • 11
    • 12244307636 scopus 로고    scopus 로고
    • PhD thesis, University of Economics, Prague, Czech Republic
    • Marta Vomlelová (2001) Decision Theoretic Troubleshooting. PhD thesis, University of Economics, Prague, Czech Republic
    • (2001) Decision Theoretic Troubleshooting
    • Vomlelová, M.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.