메뉴 건너뛰기




Volumn 36, Issue 8, 2001, Pages 112-120

Generating decision trees for decoding binaries

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0041691443     PISSN: 03621340     EISSN: None     Source Type: Journal    
DOI: 10.1145/384196.384213     Document Type: Article
Times cited : (15)

References (21)
  • 9
    • 84976247346 scopus 로고
    • Comparison of Priority Rules in Pattern Matching and Term Rewriting
    • April
    • A. Laville. Comparison of Priority Rules in Pattern Matching and Term Rewriting. Journal of Symbolic Computations, 11(4):321-348, April 1991.
    • (1991) Journal of Symbolic Computations , vol.11 , Issue.4 , pp. 321-348
    • Laville, A.1
  • 13
    • 0020300879 scopus 로고
    • Decision Trees and Diagrams
    • B. M. E. Moret. Decision Trees and Diagrams. Computing Surveys, 14(4), 1982.
    • (1982) Computing Surveys , vol.14 , Issue.4
    • Moret, B.M.E.1
  • 15
    • 0002431740 scopus 로고    scopus 로고
    • Automatic Construction of Decision Trees from Data: A Multi-Disciplinary Survey
    • January
    • S. K. Murthy. Automatic Construction of Decision Trees from Data: A Multi-Disciplinary Survey. Data Mining and Knowledge Discovery, 2(4), January 1998.
    • (1998) Data Mining and Knowledge Discovery , vol.2 , Issue.4
    • Murthy, S.K.1
  • 16
    • 0000039023 scopus 로고
    • Calculating the Maximum Execution Time of Real-Time Programs
    • P. Puschner and C. Koza. Calculating the Maximum Execution Time of Real-Time Programs. Real-Time Systems, 1, 1989.
    • (1989) Real-Time Systems , vol.1
    • Puschner, P.1    Koza, C.2
  • 21


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