메뉴 건너뛰기




Volumn , Issue , 2004, Pages 399-406

Towards a Structured Analysis of Approximate Problem Solving: A Case Study in Classification

Author keywords

Anytime Inference; Approximate Problem Solving; Classification

Indexed keywords

APPROXIMATION THEORY; CASE BASED REASONING;

EID: 33646414581     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (3)

References (11)
  • 2
    • 0342718704 scopus 로고    scopus 로고
    • Anytime families of tractable propositional reasoners
    • Extended version submitted to Annals of Mathematics and Artifical Intelligence
    • Dalal, M. 1996. Anytime families of tractable propositional reasoners. In International Symposium on Artifical Intelligence and Mathematics AI/MATH-96, 42-45. Extended version submitted to Annals of Mathematics and Artifical Intelligence.
    • (1996) International Symposium on Artifical Intelligence and Mathematics AI/MATH-96 , pp. 42-45
    • Dalal, M.1
  • 7
    • 0029290445 scopus 로고
    • Tractable reasoning via approximation
    • Schaerf, M., and Cadoli, M. 1995. Tractable reasoning via approximation. Artificial Intelligence 74:249-310.
    • (1995) Artificial Intelligence , vol.74 , pp. 249-310
    • Schaerf, M.1    Cadoli, M.2
  • 10
    • 0030122886 scopus 로고    scopus 로고
    • Optimal composition of real-time systems
    • Zilberstein, S., and Russell, S. J. 1996. Optimal composition of real-time systems. Artificial Intelligence 82(1-2):181-213.
    • (1996) Artificial Intelligence , vol.82 , Issue.1-2 , pp. 181-213
    • Zilberstein, S.1    Russell, S. J.2


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