메뉴 건너뛰기




Volumn 4980 LNCS, Issue , 2011, Pages 246-260

Testing of heuristic methods: A case study of greedy algorithm

Author keywords

greedy algorithm; heuristic method; metamorphic testing

Indexed keywords

APPROXIMATE SOLUTION; EXACT SOLUTION; FAILURE DETECTION; GLOBALOPTIMUM; GREEDY ALGORITHMS; METAMORPHIC TESTING; ORACLE PROBLEM; SET COVERING PROBLEM;

EID: 80053170135     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-22386-0_19     Document Type: Conference Paper
Times cited : (9)

References (17)
  • 1
    • 0016349356 scopus 로고
    • Application of algorithms for combinatorial problems
    • Johnson, D.S.: Application of algorithms for combinatorial problems. Journal of Computer and System Science 9(3), 256-278 (1974)
    • (1974) Journal of Computer and System Science , vol.9 , Issue.3 , pp. 256-278
    • Johnson, D.S.1
  • 5
    • 0020204093 scopus 로고
    • On testing non-testable programs
    • Weyuker, E.J.: On testing non-testable programs. The Computer Journal 25(4), 465-470 (1982)
    • (1982) The Computer Journal , vol.25 , Issue.4 , pp. 465-470
    • Weyuker, E.J.1


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