메뉴 건너뛰기




Volumn 3709 LNCS, Issue , 2005, Pages 32-46

Dynamic ordering for asynchronous backtracking on DisCSPs

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; HEURISTIC METHODS; POLYNOMIALS;

EID: 33646183942     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11564751_6     Document Type: Conference Paper
Times cited : (8)

References (18)
  • 1
    • 10044279570 scopus 로고    scopus 로고
    • Asynchronous backtracking without adding links: A new member in the abt family
    • January
    • C, Bessiere, A. Maestre, I. Brito, and P. Meseguer. Asynchronous backtracking without adding links: a new member in the abt family. Artificial Intelligence, 161:1-2:7-24, January 2005.
    • (2005) Artificial Intelligence , vol.161 , Issue.1-2 , pp. 7-24
    • Bessiere, C.1    Maestre, A.2    Brito, I.3    Meseguer, P.4
  • 6
    • 10044234721 scopus 로고    scopus 로고
    • Distributed interleaved parallel and cooperative search in constraint satisfaction networks
    • Singappore
    • Y. Hamadi. Distributed interleaved parallel and cooperative search in constraint satisfaction networks. In Proc. IAT-01, Singappore, 2001.
    • (2001) Proc. IAT-01
    • Hamadi, Y.1
  • 7
    • 0017972109 scopus 로고
    • Time, clocks, and the ordering of events in distributed system
    • April
    • L. Lamport. Time, clocks, and the ordering of events in distributed system. Communication of the ACM, 2:95-114, April 1978.
    • (1978) Communication of the ACM , vol.2 , pp. 95-114
    • Lamport, L.1
  • 11
    • 10044262291 scopus 로고    scopus 로고
    • Asynchronous aggregation and consistency in distributed constraint satisfaction
    • January
    • M. C. Silaghi and B. Faltings. Asynchronous aggregation and consistency in distributed constraint satisfaction. Artificial Intelligence, 161:1-2:25-54, January 2005.
    • (2005) Artificial Intelligence , vol.161 , Issue.1-2 , pp. 25-54
    • Silaghi, M.C.1    Faltings, B.2
  • 12
    • 33646177032 scopus 로고    scopus 로고
    • Hybridizing abt and awe into a polynomial space, complete protocol with reordering
    • EPFL, May
    • M. C. Silaghi, D. Sam-Haroud, and B. Faltings. Hybridizing abt and awe into a polynomial space, complete protocol with reordering. Technical Report 01/#364, EPFL, May 2001.
    • (2001) Technical Report , vol.1 , Issue.364
    • Silaghi, M.C.1    Sam-Haroud, D.2    Faltings, B.3
  • 13
    • 0030105626 scopus 로고    scopus 로고
    • Locating the phase transition in binary constraint satisfaction problems
    • B. M. Smith. Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence, 81:155-181, 1996.
    • (1996) Artificial Intelligence , vol.81 , pp. 155-181
    • Smith, B.M.1
  • 14
    • 84957868254 scopus 로고    scopus 로고
    • Modeling and solving distributed constraint satisfaction problems (dcsps)
    • New Hamphshire, October
    • G. Solotorevsky, E. Gudes, and A. Meisels. Modeling and solving distributed constraint satisfaction problems (dcsps). In Constraint Processing-96, pages 561-2, New Hamphshire, October 1996.
    • (1996) Constraint Processing-96 , pp. 561-562
    • Solotorevsky, G.1    Gudes, E.2    Meisels, A.3
  • 15
    • 84958042223 scopus 로고
    • Asynchronous weak-commitment search for solving distributed constraint satisfaction problems
    • Cassis, France
    • M. Yokoo. Asynchronous weak-commitment search for solving distributed constraint satisfaction problems. In Proc. 1st Intrnat. Conf. on Const. Progr., pages 88-102, Cassis, France, 1995.
    • (1995) Proc. 1st Intrnat. Conf. on Const. Progr. , pp. 88-102
    • Yokoo, M.1
  • 16
    • 0034411116 scopus 로고    scopus 로고
    • Algorithms for distributed constraint satisfaction problems: A review
    • M. Yokoo. Algorithms for distributed constraint satisfaction problems: A review. Autonomous Agents & Multi-Agent Sys., 3:198-212, 2000.
    • (2000) Autonomous Agents & Multi-agent Sys. , vol.3 , pp. 198-212
    • Yokoo, M.1


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