메뉴 건너뛰기




Volumn 2239, Issue , 2001, Pages 464-478

Specializing Russian doll search

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAMMING;

EID: 36348959277     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45578-7_32     Document Type: Conference Paper
Times cited : (12)

References (11)
  • 1
    • 0013401045 scopus 로고    scopus 로고
    • A weighted arc consistency technique for Max- CSP
    • M. S. Affane and H. Bennaceur. A weighted arc consistency technique for Max- CSP. In Proc. of the 13th ECAI, 209–213, 1998.
    • (1998) Proc. Of the 13Th ECAI , pp. 209-213
    • Affane, M.S.1    Bennaceur, H.2
  • 6
    • 0013436434 scopus 로고    scopus 로고
    • Optimal solutions for a frequency assignment problem via tree-decomposition
    • A.M. Koster, C. P. Hoesel and A. W. Kolen. Optimal solutions for a frequency assignment problem via tree-decomposition. In Lecture Notes in Computer Science, 1665:338-349, 1999.
    • (1999) Lecture Notes in Computer Science , vol.1665 , pp. 338-349
    • Koster, A.M.1    Hoesel, C.P.2    Kolen, A.W.3
  • 7
    • 57649226744 scopus 로고    scopus 로고
    • Exploiting the use of DAC in Max-CSP
    • J. Larrosa and P. Meseguer. Exploiting the use of DAC in Max-CSP. In Proc. of the 2th CP, 308–322, 1996.
    • (1996) Proc. Of the 2Th CP , pp. 308-322
    • Larrosa, J.1    Meseguer, P.2
  • 9
    • 0002582645 scopus 로고
    • Valued Constraint Satisfaction Problems: Hard and easy problems
    • T. Schiex, H. Fargier and G. Verfaillie. Valued Constraint Satisfaction Problems: hard and easy problems. In Proc. of the 14th IJCAI, 631–637, 1995.
    • (1995) Proc. Of the 14Th IJCAI , pp. 631-637
    • Schiex, T.1    Fargier, H.2    Verfaillie, G.3


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