메뉴 건너뛰기




Volumn 1, Issue , 2008, Pages 156-161

Coalition structure generation: Dynamic programming meets anytime optimization

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; DYNAMIC PROGRAMMING; INTERNET PROTOCOLS; STRUCTURAL OPTIMIZATION; SYSTEMS ENGINEERING;

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

References (12)
  • 1
    • 33750735386 scopus 로고    scopus 로고
    • Overlapping coalition formation for efficient data fusion in multi-sensor networks
    • Dang, V. D.; Dash, R. K.; Rogers, A.; and Jennings, N. R. 2006. Overlapping coalition formation for efficient data fusion in multi-sensor networks. In AAAI-06, 635-640.
    • (2006) AAAI-06 , pp. 635-640
    • Dang, V.D.1    Dash, R.K.2    Rogers, A.3    Jennings, N.R.4
  • 2
    • 0034403967 scopus 로고    scopus 로고
    • Anytime coalition structure generation: An average case study
    • Larson, K., and Sandholm, T. 2000. Anytime coalition structure generation: an average case study. J. Exp. and Theor. Artif. Intell. 12(1):23-12.
    • (2000) J. Exp. and Theor. Artif. Intell , vol.12 , Issue.1 , pp. 23-12
    • Larson, K.1    Sandholm, T.2
  • 3
    • 84899951120 scopus 로고    scopus 로고
    • An improved dynamic programming algorithm for coalition structure generation
    • Rahwan, T., and Jennings, N. R. 2008. An improved dynamic programming algorithm for coalition structure generation. In AAMAS-08.
    • (2008) AAMAS , vol.8
    • Rahwan, T.1    Jennings, N.R.2
  • 4
    • 84880894227 scopus 로고    scopus 로고
    • Near-optimal anytime coalition structure generation
    • Rahwan, T.; Ramchurn, S. D.; Dang, V. D.; and Jennings, N. R. 2007a. Near-optimal anytime coalition structure generation. In IJCAI-07, 2365-2371.
    • (2007) IJCAI-07 , pp. 2365-2371
    • Rahwan, T.1    Ramchurn, S.D.2    Dang, V.D.3    Jennings, N.R.4
  • 6
    • 0031191005 scopus 로고    scopus 로고
    • Coalitions among computationally bounded agents
    • Sandholm, T. W., and Lesser, V. R. 1997. Coalitions among computationally bounded agents. Artificial Intelligence 94(1):99-137.
    • (1997) Artificial Intelligence , vol.94 , Issue.1 , pp. 99-137
    • Sandholm, T.W.1    Lesser, V.R.2
  • 8
    • 0033165014 scopus 로고    scopus 로고
    • Coalition structure generation with worst case guarantees. Artificial Intelligence 111(1-2):209-238.
    • Coalition structure generation with worst case guarantees. Artificial Intelligence 111(1-2):209-238.
  • 10
    • 0032074719 scopus 로고    scopus 로고
    • Methods for task allocation via agent coalition formation
    • Shehory, O., and Kraus, S. 1998. Methods for task allocation via agent coalition formation. Artificial Intelligence 101(1-2):165-200.
    • (1998) Artificial Intelligence , vol.101 , Issue.1-2 , pp. 165-200
    • Shehory, O.1    Kraus, S.2
  • 12
    • 0022917874 scopus 로고
    • A dynamic programming approach to the complete set partitioning problem
    • Yeh, D. Y. 1986. A dynamic programming approach to the complete set partitioning problem. BIT Numerical Mathematics 26(4):467-174.
    • (1986) BIT Numerical Mathematics , vol.26 , Issue.4 , pp. 467-174
    • Yeh, D.Y.1


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