메뉴 건너뛰기




Volumn 4953 LNAI, Issue , 2008, Pages 411-420

An approach to event-driven algorithm for intelligent agents in multi-agent systems

Author keywords

Algorithms; Event driven algorithm; Graphs; Intelligent agents; Meta agents; Multi agent systems; Networks

Indexed keywords

AGENTS; ARTIFICIAL INTELLIGENCE; BOOLEAN FUNCTIONS; COMPUTER SOFTWARE; GRAPH THEORY; INTELLIGENT AGENTS; INTELLIGENT SYSTEMS; REDUCING AGENTS;

EID: 47249092174     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78582-8_42     Document Type: Conference Paper
Times cited : (5)

References (19)
  • 5
    • 47249101285 scopus 로고    scopus 로고
    • Ferg, S.: Event-Driven Programming: Introduction, Tutorial, History (2006-02-08), http://TutorialEventDrivenProgramming.sourceforge.net
    • Ferg, S.: Event-Driven Programming: Introduction, Tutorial, History (2006-02-08), http://TutorialEventDrivenProgramming.sourceforge.net
  • 9
    • 38049127176 scopus 로고    scopus 로고
    • Håkansson, A., Hartung, R.: Calculating Optimal Decision Using Meta-level Agents for Multi-Agents in Networks. In: Apolloni, B., Howlett, R.J., Jain, L. (eds.) KES 2007, Part I. LNCS (LNAI), 4692, pp. 180-188. Springer, Heidelberg (2007)
    • Håkansson, A., Hartung, R.: Calculating Optimal Decision Using Meta-level Agents for Multi-Agents in Networks. In: Apolloni, B., Howlett, R.J., Jain, L. (eds.) KES 2007, Part I. LNCS (LNAI), vol. 4692, pp. 180-188. Springer, Heidelberg (2007)
  • 10
    • 0032182881 scopus 로고    scopus 로고
    • Real-Time Search for Autonomous Agents and Multi-Agent Systems
    • Ishida, T.: Real-Time Search for Autonomous Agents and Multi-Agent Systems. Journal of Autonomous Agents and Multi-Agent Systems 1(2), 139-167 (1998)
    • (1998) Journal of Autonomous Agents and Multi-Agent Systems , vol.1 , Issue.2 , pp. 139-167
    • Ishida, T.1
  • 11
    • 70350674995 scopus 로고
    • On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem
    • Kruskal, J.B.: On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem. Proceedings of the American Mathematical Society 7(1), 48-50 (1956)
    • (1956) Proceedings of the American Mathematical Society , vol.7 , Issue.1 , pp. 48-50
    • Kruskal, J.B.1
  • 14
    • 84911584312 scopus 로고
    • Shortest connection networks and some generalizations
    • Prim, R.C.: Shortest connection networks and some generalizations. Bell System Technical Journal 36, 1389-1401 (1957)
    • (1957) Bell System Technical Journal , vol.36 , pp. 1389-1401
    • Prim, R.C.1


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