메뉴 건너뛰기




Volumn 1, Issue , 1999, Pages 234-239

Remembering to add: Competence-preserving case-addition policies for case-base maintenance

Author keywords

[No Author keywords available]

Indexed keywords

CASE BASE; CASE BASE MAINTENANCE; CASE-BASED PLANNING; CASEBASED REASONINGS (CBR); CBR SYSTEMS; LOWER BOUNDS; MAINTENANCE ALGORITHMS;

EID: 84880664443     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (82)

References (22)
  • 2
    • 0025725905 scopus 로고
    • Instance-based learning algorithms
    • D. Aha, D. Kibler, and M. Albert, Instance-based learning algorithms. Machine Learning, 6:37 66, 1991.
    • (1991) Machine Learning , vol.6 , pp. 37-66
    • Aha, D.1    Kibler, D.2    Albert, M.3
  • 7
    • 0025488956 scopus 로고
    • Explaining and repairing plans that fail
    • Kristian Hammond. Explaining and repairing plans that fail. Artificial Intelligence, 45(1): 173 228, 1990.
    • (1990) Artificial Intelligence , vol.45 , Issue.1 , pp. 173-228
    • Hammond, K.1
  • 8
    • 0000487049 scopus 로고
    • A domain-independent algorithm for plan adpatation
    • January
    • Steve Hanks and Daniel S. Weld. A domain-independent algorithm for plan adpatation. Journal of Artificial Intelligence Research, 2:319 360, January 1995.
    • (1995) Journal of Artificial Intelligence Research , vol.2 , pp. 319-360
    • Hanks, S.1    Weld, D.S.2
  • 10
    • 0029333545 scopus 로고
    • Planning as refinement, search: A unified framework for evaluating design tradeoffs in partial-order planning
    • Special Issue on Planning and Scheduling, edited by J. Hendler and D. McDermott
    • Subbarao Kambhampati, Craig A. Knoblock, and Qiang Yang. Planning as refinement, search: A unified framework for evaluating design tradeoffs in partial-order planning. Artificial Intelligence, 75(3), 1995. Special Issue on Planning and Scheduling, edited by J. Hendler and D. McDermott.
    • (1995) Artificial Intelligence , vol.75 , Issue.3
    • Kambhampati, S.1    Knoblock, C.A.2    Yang, Q.3
  • 14
    • 0025398889 scopus 로고
    • Quantitative results concerning the utility of explanation-based learning
    • S. Minton. Qualitative results concerning the utility of explanation-based learning. Artificial Intelligence, 42:363-391, 1990. (Pubitemid 20673787)
    • (1990) Artificial Intelligence , vol.42 , Issue.2-3 , pp. 363-391
    • Minton, S.1
  • 17
    • 0001301027 scopus 로고
    • Remembering to forget: A competence-preserving case deletion policy for case-based reasoning systems
    • B. Smyth and M. Keane. Remembering to forget: A competence-preserving case deletion policy for case-based reasoning systems. In International Joint Conference on Artificial Intelligence, volume 1, pages 377 382, 1995.
    • (1995) International Joint Conference on Artificial Intelligence , vol.1 , pp. 377-382
    • Smyth, B.1    Keane, M.2


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