메뉴 건너뛰기




Volumn 34, Issue 3, 2004, Pages 1490-1499

On a multimode test sequencing problem

Author keywords

AND OR graph search; AO; Entropy; Huffman coding; Information heuristic; Rollout algorithm; Sequential fault diagnosis; Test sequencing problem

Indexed keywords

FAILURE ANALYSIS; GRAPH THEORY; HEURISTIC PROGRAMMING; IDENTIFICATION (CONTROL SYSTEMS);

EID: 2942549041     PISSN: 10834419     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSMCB.2004.825940     Document Type: Article
Times cited : (25)

References (20)
  • 1
    • 0000050873 scopus 로고
    • Hybrid automata: An algorithm approach to the specification and verification of hybrid systems
    • R. L. Grossman et al., Eds, Berlin: Springer
    • R. Alur et al., "Hybrid automata: An algorithm approach to the specification and verification of hybrid systems," in Lecture Notes in Computer Science, R. L. Grossman et al., Eds, Berlin: Springer, 1993, pp. 209-229.
    • (1993) Lecture Notes in Computer Science , pp. 209-229
    • Alur, R.1
  • 3
    • 0025456824 scopus 로고
    • Application of heuristic search and information theory to sequential fault diagnosis
    • July/Aug.
    • K. R. Pattipati and M. G. Alexandridis, "Application of heuristic search and information theory to sequential fault diagnosis," IEEE Trans. Syst., Man, Cybern., vol. SMC-20, pp. 872-887, July/Aug. 1990.
    • (1990) IEEE Trans. Syst., Man, Cybern. , vol.SMC-20 , pp. 872-887
    • Pattipati, K.R.1    Alexandridis, M.G.2
  • 5
    • 0031272681 scopus 로고    scopus 로고
    • Rollout algorithms for combinatorial optimization
    • D. P. Bertsekas, J. N. Tsitsiklis, and C. Wu, "Rollout algorithms for combinatorial optimization," J. Heuristics, vol. 3, no. 3, pp. 245-262, 1997.
    • (1997) J. Heuristics , vol.3 , Issue.3 , pp. 245-262
    • Bertsekas, D.P.1    Tsitsiklis, J.N.2    Wu, C.3
  • 6
    • 0344672463 scopus 로고    scopus 로고
    • Rollout algorithms for stochastic scheduling problems
    • D. P. Bertsekas and D. A. Castanon, "Rollout algorithms for stochastic scheduling problems," J. Heuristics, vol. 5, pp. 89-108, 1999.
    • (1999) J. Heuristics , vol.5 , pp. 89-108
    • Bertsekas, D.P.1    Castanon, D.A.2
  • 8
    • 0142196590 scopus 로고    scopus 로고
    • Rollout strategy for sequential fault diagnosis
    • Jan.
    • F. Tu and K. R. Pattipati, "Rollout strategy for sequential fault diagnosis," IEEE Trans. Syst., Man, Cybern. A, vol. 33, pp. 86-99, Jan. 2003.
    • (2003) IEEE Trans. Syst., Man, Cybern. A , vol.33 , pp. 86-99
    • Tu, F.1    Pattipati, K.R.2
  • 9
    • 0015403290 scopus 로고
    • Optimal binary identification procedures
    • Sept.
    • M. R. Garey, "Optimal binary identification procedures," SIAM J. Appl. Math., vol. 33, no. 2, pp. 173-186, Sept. 1972.
    • (1972) SIAM J. Appl. Math. , vol.33 , Issue.2 , pp. 173-186
    • Garey, M.R.1
  • 10
    • 0016331864 scopus 로고
    • Performance bounds on the splitting algorithm for binary testing
    • M. R. Garey and R. L. Graham, "Performance bounds on the splitting algorithm for binary testing," Acta Inform, vol. 3, no. 4, pp. 347-355, 1974.
    • (1974) Acta Inform , vol.3 , Issue.4 , pp. 347-355
    • Garey, M.R.1    Graham, R.L.2
  • 12
    • 0020090653 scopus 로고
    • Application of information theory to sequential fault diagnosis
    • P. K. Varshney, C. R. P. Hartmann, and J. M. DeFaria, Jr., "Application of information theory to sequential fault diagnosis," IEEE Trans. Comput., vol. C-31, pp. 164-170, 1982.
    • (1982) IEEE Trans. Comput. , vol.C-31 , pp. 164-170
    • Varshney, P.K.1    Hartmann, C.R.P.2    DeFaria Jr., J.M.3
  • 13
    • 0032737895 scopus 로고    scopus 로고
    • Optimal and near-optimal test sequencing algorithms with realistic test models
    • Jan.
    • V. Raghavan, K. Pattipati, and M. Shakeri, "Optimal and near-optimal test sequencing algorithms with realistic test models," IEEE Trans. Syst., Man, Cybern. A, vol. 29, pp. 11-26, Jan. 1999.
    • (1999) IEEE Trans. Syst., Man, Cybern. A , vol.29 , pp. 11-26
    • Raghavan, V.1    Pattipati, K.2    Shakeri, M.3
  • 15
    • 0018046320 scopus 로고
    • Optimizing decision trees through heuristically guided search
    • ____, "Optimizing decision trees through heuristically guided search," Commun. ACM, vol. 21, no. 12, pp. 1025-1039, 1978.
    • (1978) Commun. ACM , vol.21 , Issue.12 , pp. 1025-1039
    • Martelli, A.1    Montanari, U.2
  • 16
    • 0021973537 scopus 로고
    • AND/OR graph heuristic search methods
    • A. Mahanti and A. Bagchi, "AND/OR graph heuristic search methods," J. ACM, vol. 32, no. 1, pp. 28-51, 1985.
    • (1985) J. ACM , vol.32 , Issue.1 , pp. 28-51
    • Mahanti, A.1    Bagchi, A.2
  • 19
    • 0023825499 scopus 로고
    • Admissibility of AO* with heuristics overestimate
    • P. P. Chakrabarti, S. Ghose, and S. C. Desarkar, "Admissibility of AO* with heuristics overestimate," Artif. Intell., vol. 34, pp. 97-113, 1988.
    • (1988) Artif. Intell. , vol.34 , pp. 97-113
    • Chakrabarti, P.P.1    Ghose, S.2    Desarkar, S.C.3
  • 20
    • 0026379383 scopus 로고
    • A mathematical model for integrated diagnostics
    • Oct./Dec.
    • J. W. Sheppard and W. R. Simpson, "A mathematical model for integrated diagnostics," IEEE Design Test Comput., vol. 8, pp. 25-38, Oct./Dec. 1991.
    • (1991) IEEE Design Test Comput. , vol.8 , pp. 25-38
    • Sheppard, J.W.1    Simpson, W.R.2


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