메뉴 건너뛰기




Volumn 141, Issue , 2006, Pages 195-199

Strengthening admissible coalitions

Author keywords

[No Author keywords available]

Indexed keywords

ANALYSIS OF ALGORITHMS; COALITION FORMATIONS; FORMAL DESCRIPTION; GOAL-DIRECTED; PROPERTY;

EID: 84886041847     PISSN: 09226389     EISSN: 18798314     Source Type: Book Series    
DOI: None     Document Type: Article
Times cited : (18)

References (10)
  • 1
    • 0042908709 scopus 로고    scopus 로고
    • Alternating-time temporal logic
    • R. Alur, T.A. Henzinger, and O. Kupferman, 'Alternating-time temporal logic', Journal of ACM, 49(5), 672-713, (2002).
    • (2002) Journal of ACM , vol.49 , Issue.5 , pp. 672-713
    • Alur, R.1    Henzinger, T.A.2    Kupferman, O.3
  • 6
    • 0346008343 scopus 로고    scopus 로고
    • Algorithms of distributed task allocation for cooperative agents
    • S. Kraus and T. Plotkin, 'Algorithms of distributed task allocation for cooperative agents', Theoretical Computer Science, 242(1-2), 1-27, (2000).
    • (2000) Theoretical Computer Science , vol.242 , Issue.1-2 , pp. 1-27
    • Kraus, S.1    Plotkin, T.2
  • 9
    • 0001790593 scopus 로고
    • Depth-first search and linear graph algorithms
    • R. Tarjan, 'Depth-first search and linear graph algorithms', SIAM Journal of Computation, 1(2), 146-160, (1972).
    • (1972) SIAM Journal of Computation , vol.1 , Issue.2 , pp. 146-160
    • Tarjan, R.1
  • 10
    • 3142697097 scopus 로고    scopus 로고
    • On the computational complexity of qualitative coalitional games
    • M. Wooldridge and P.E. Dunne, 'On the computational complexity of qualitative coalitional games', Artificial Intelligence, 158(1), 27-73, (2004).
    • (2004) Artificial Intelligence , vol.158 , Issue.1 , pp. 27-73
    • Wooldridge, M.1    Dunne, P.E.2


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