메뉴 건너뛰기




Volumn , Issue , 2009, Pages 370-373

Learning user plan preferences obfuscated by feasibility constraints

Author keywords

[No Author keywords available]

Indexed keywords

A-PLANE; BASE LEARNERS; GRADUATE STUDENTS; HIERARCHICAL TASK NETWORKS; NON-INTRUSIVE; NOVEL METHODS; TRAINING PLAN; TRAVEL PLANNING;

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

References (5)
  • 2
    • 84880903147 scopus 로고    scopus 로고
    • On natural language processing and plan recognition
    • Geib, C. W., and Steedman, M. 2007. On natural language processing and plan recognition. In IJCAI.
    • (2007) IJCAI
    • Geib, C.W.1    Steedman, M.2
  • 3
    • 0002532056 scopus 로고
    • The estimation of stochastic context-free grammars using the inside-outside algorithm
    • Lari, K., and Young, S. J. 1990. The estimation of stochastic context-free grammars using the inside-outside algorithm. Computer Speech and Language.
    • (1990) Computer Speech and Language
    • Lari, K.1    Young, S.J.2
  • 4
    • 78751698487 scopus 로고    scopus 로고
    • Learning probabilistic hierarchical task networks to capture user preferences
    • Li, N.; Kambhampati, S.; and Yoon, S. 2009. Learning probabilistic hierarchical task networks to capture user preferences. In IJCAI.
    • (2009) IJCAI
    • Li, N.1    Kambhampati, S.2    Yoon, S.3
  • 5
    • 84880665976 scopus 로고    scopus 로고
    • Shop: Simple hierarchical ordered planner
    • Nau, D. S.; Cao, Y.; Lotem, A.; and Hector Mu n.-A. 1999. Shop: Simple hierarchical ordered planner. In IJCAI.
    • (1999) IJCAI
    • Nau, D.S.1    Cao, Y.2    Lotem, A.3    Mun-A, H.4


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