메뉴 건너뛰기




Volumn 1, Issue , 2006, Pages 62-67

A BDD-based polytime algorithm for cost-bounded interactive configuration

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; DECISION SUPPORT SYSTEMS; INTERACTIVE COMPUTER SYSTEMS; PARAMETER ESTIMATION; POLYNOMIALS; PROBLEM SOLVING; REAL TIME SYSTEMS;

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

References (11)
  • 1
    • 0036467697 scopus 로고    scopus 로고
    • Consistency restoration and explanations in dynamic CSPs-application to configuration
    • Amilhastre, J.; Fargier, H.; and Marquis, P. 2002. Consistency restoration and explanations in dynamic CSPs-application to configuration. Artificial Intelligence 1-2.
    • (2002) Artificial Intelligence , pp. 1-2
    • Amilhastre, J.1    Fargier, H.2    Marquis, P.3
  • 2
    • 0022769976 scopus 로고
    • Graph-based algorithms for boolean function manipulation
    • Bryant, R. E. 1986. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers 8:677-691.
    • (1986) IEEE Transactions on Computers , vol.8 , pp. 677-691
    • Bryant, R.E.1
  • 3
    • 33750694479 scopus 로고    scopus 로고
    • CLib. online. Configuration benchmarks library
    • CLib. online. Configuration benchmarks library. http://www.itu.dk/doi/ VeCoS/clib/.


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