메뉴 건너뛰기




Volumn , Issue , 2009, Pages 375-382

Domain knowledge uncertainty and probabilistic parameter constraints

Author keywords

[No Author keywords available]

Indexed keywords

CONDITIONAL MODELS; DEGREE OF UNCERTAINTY; DOMAIN KNOWLEDGE; LEARNING ACCURACY; MODELING PROCESS; PARAMETER CONSTRAINTS; PARAMETER SPACES; PROBABILISTIC CONSTRAINTS;

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

References (9)
  • 3
    • 49949144765 scopus 로고
    • The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming
    • L. M. Bregman. The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Computational Mathematics and Mathematical Physics, 7:200-217, 1967.
    • (1967) USSR Computational Mathematics and Mathematical Physics , vol.7 , pp. 200-217
    • Bregman, L.M.1


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