메뉴 건너뛰기




Volumn 1713, Issue , 1999, Pages 303-315

Partition-based lower bound for max-CSP

Author keywords

[No Author keywords available]

Indexed keywords

AGGREGATES; ALGORITHMS; COMPUTER PROGRAMMING; CONSTRAINT THEORY;

EID: 33750363286     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-48085-3_22     Document Type: Conference Paper
Times cited : (20)

References (10)
  • 4
    • 84957391258 scopus 로고    scopus 로고
    • Exploiting the use of DAC in Max-CSP
    • Boston, USA
    • Larrosa J., Meseguer P. Exploiting the use of DAC in Max-CSP. In Proc. of the 2nd. CP, Boston, USA, 1996.
    • Proc. Of the 2Nd. CP , pp. 1996
    • Larrosa, J.1    Meseguer, P.2
  • 6
    • 0002419614 scopus 로고
    • Binary Constraint Satisfaction Problems: Some are Harder than Others
    • Amsterdam, The Netherlands
    • Prosser P. Binary Constraint Satisfaction Problems: Some are Harder than Others. In Proc. of the 11th. ECAI, Amsterdam, The Netherlands, 1994.
    • (1994) Proc. Of the 11Th. ECAI
    • Prosser, P.1
  • 8
    • 0002582645 scopus 로고
    • Valued Constraint Satisfaction Problems: Hard and easy problems
    • Montreal, Canada
    • Schiex T., Fargier H., Verfaillie G. Valued Constraint Satisfaction Problems: hard and easy problems. In Proc. of the 14th IJCAI, Montreal, Canada, 1995.
    • (1995) Proc. Of the 14Th IJCAI
    • Schiex, T.1    Fargier, H.2    Verfaillie, G.3


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