메뉴 건너뛰기




Volumn 1, Issue , 2006, Pages 703-708

ODPOP: An algorithm for open/distributed constraint optimization

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL MATHEMATICS; CONSTRAINT THEORY; DYNAMIC PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

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

References (17)
  • 4
    • 0022144787 scopus 로고
    • A sufficient condition for backtrack-bounded search
    • Freuder, E. C. 1985. A sufficient condition for backtrack-bounded search. Journal of the ACM 32 (14):755-761.
    • (1985) Journal of the ACM , vol.32 , Issue.14 , pp. 755-761
    • Freuder, E.C.1
  • 5
    • 0001545454 scopus 로고    scopus 로고
    • Backtracking in distributed constraint networks
    • Hamadi, Y.; Bessière, C.; and Quinqueton, J. 1998. Backtracking in distributed constraint networks. In ECAI-98, 219-223.
    • (1998) ECAI-98 , pp. 219-223
    • Hamadi, Y.1    Bessière, C.2    Quinqueton, J.3
  • 6
    • 33750707077 scopus 로고    scopus 로고
    • Unifying cluster-tree decompositions for automated reasoning in graphical models
    • Kask, K.; Dechter, R.; and Larrosa, J. 2005. Unifying cluster-tree decompositions for automated reasoning in graphical models. Artificial Intelligence.
    • (2005) Artificial Intelligence
    • Kask, K.1    Dechter, R.2    Larrosa, J.3
  • 7
    • 4544376849 scopus 로고    scopus 로고
    • Taking DCOP to the realworld: Efficient complete solutions for distributed multi-event scheduling
    • Maheswaran, R. T.; Tambe, M.; Bowring, E.; Pearce, J. P.; and Varakantham, P. 2004. Taking DCOP to the realworld: Efficient complete solutions for distributed multi-event scheduling. In AAMAS-04.
    • (2004) AAMAS-04
    • Maheswaran, R.T.1    Tambe, M.2    Bowring, E.3    Pearce, J.P.4    Varakantham, P.5
  • 8
    • 10044277219 scopus 로고    scopus 로고
    • ADOPT: Asynchronous distributed constraint optimization with quality guarantees
    • Modi, P. J.; Shen, W.-M.; Tambe, M.; and Yokoo, M. 2005. ADOPT: Asynchronous distributed constraint optimization with quality guarantees. M Journal 161:149-180.
    • (2005) M Journal , vol.161 , pp. 149-180
    • Modi, P.J.1    Shen, W.-M.2    Tambe, M.3    Yokoo, M.4
  • 14
    • 0033727048 scopus 로고    scopus 로고
    • Distributed asynchronous search with private constraints
    • Silaghi, M.-C.; Sam-Haroud, D.; and Faltings, B. 2000. Distributed asynchronous search with private constraints. In Proc. of AA2000, 177-178.
    • (2000) Proc. of AA2000 , pp. 177-178
    • Silaghi, M.-C.1    Sam-Haroud, D.2    Faltings, B.3
  • 17
    • 33750692517 scopus 로고    scopus 로고
    • Concurrent dynamic backtracking for distribuled CSPs
    • Springer Verlag
    • Zivan, R., and Meisels, A. 2004. Concurrent Dynamic Backtracking for Distribuled CSPs. In Lecture Notes in Computer Science, volume 3258. Springer Verlag. 782-787.
    • (2004) Lecture Notes in Computer Science , vol.3258 , pp. 782-787
    • Zivan, R.1    Meisels, A.2


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