메뉴 건너뛰기




Volumn 25, Issue , 2006, Pages 529-576

Asynchronous partial overlay: A new algorithm for solving distributed constraint satisfaction problems

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SUPPORTED COOPERATIVE WORK; CONSTRAINT THEORY; DISTRIBUTED COMPUTER SYSTEMS; MULTI AGENT SYSTEMS; PROBLEM SOLVING;

EID: 33744462868     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.1786     Document Type: Article
Times cited : (49)

References (31)
  • 7
    • 0034889013 scopus 로고    scopus 로고
    • Frozen development in graph coloring
    • Culberson, J., & Gent, I. (2001). Frozen development in graph coloring. Theoretical Computer Science, 265(1-2), 227-264.
    • (2001) Theoretical Computer Science , vol.265 , Issue.1-2 , pp. 227-264
    • Culberson, J.1    Gent, I.2
  • 10
  • 18
    • 0003924378 scopus 로고
    • Merriam-Webster (Ed.). (Home and Office edition). Springfield, IL
    • Merriam-Webster (Ed.). (1995). The Merriam-Webster Dictionary (Home and Office edition). Springfield, IL.
    • (1995) The Merriam-webster Dictionary
  • 19
    • 44049112032 scopus 로고
    • Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems
    • Minton, S., Johnston, M. D., Philips, A. B., & Laird, P. (1992). Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 55(1-3), 161-205.
    • (1992) Artificial Intelligence , vol.55 , Issue.1-3 , pp. 161-205
    • Minton, S.1    Johnston, M.D.2    Philips, A.B.3    Laird, P.4
  • 20
    • 0033536221 scopus 로고    scopus 로고
    • Determining computational complexity from characteristic 'phase transitions'
    • Monasson, R., Zecchina, R., Kirkpatrick, S., Selman, B., & Troyansky, L. (1999). Determining computational complexity from characteristic 'phase transitions'. Nature, 400, 133-137.
    • (1999) Nature , vol.400 , pp. 133-137
    • Monasson, R.1    Zecchina, R.2    Kirkpatrick, S.3    Selman, B.4    Troyansky, L.5
  • 26
    • 0028588435 scopus 로고
    • Weak-commitment search for solving constraint satisfaction problems
    • Seattle, WA, USA. AAAI Press, 1994
    • Yokoo, M. (1994). Weak-commitment search for solving constraint satisfaction problems. In Proceedings of the 12th National Conference on Artificial Intelligence (AAAI-94); Vol. 1, pp. 313-318, Seattle, WA, USA. AAAI Press, 1994.
    • (1994) Proceedings of the 12th National Conference on Artificial Intelligence (AAAI-94) , vol.1 , pp. 313-318
    • Yokoo, M.1
  • 30
    • 32944457136 scopus 로고    scopus 로고
    • Algorithms for distributed constraint satisfaction: A review
    • Yokoo, M., & Hirayama, K. (2000). Algorithms for distributed constraint satisfaction: A review. Autonomous Agents and Multi-Agent Systems, 5(2), 198-212.
    • (2000) Autonomous Agents and Multi-agent Systems , vol.5 , Issue.2 , pp. 198-212
    • Yokoo, M.1    Hirayama, K.2


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