default search action
MMAS 2018: Stockholm, Sweden
- Donghui Lin, Toru Ishida, Franco Zambonelli, Itsuki Noda:
Massively Multi-Agent Systems II - International Workshop, MMAS 2018, Stockholm, Sweden, July 14, 2018, Revised Selected Papers. Lecture Notes in Computer Science 11422, Springer 2019, ISBN 978-3-030-20936-0
Multi-agent Systems and Internet of Things
- Marco Lippi, Marco Mamei, Stefano Mariani, Franco Zambonelli:
Distributed Speaking Objects: A Case for Massive Multiagent Systems. 3-20 - Andrea Omicini, Roberta Calegari:
Injecting (Micro)Intelligence in the IoT: Logic-Based Approaches for (M)MAS. 21-35 - Donghui Lin, Yohei Murakami, Toru Ishida:
Integrating Internet of Services and Internet of Things from a Multiagent Perspective. 36-49
Architectures for Massively Multi-agent Systems
- Yohei Murakami, Takao Nakaguchi, Donghui Lin, Toru Ishida:
Two-Layer Architecture for Distributed Massively Multi-agent Systems. 53-65 - Itsuki Noda:
Multi-agent Social Simulation for Social Service Design. 66-80 - Nahum Álvarez, Itsuki Noda:
Inverse Reinforcement Learning for Agents Behavior in a Crowd Simulator. 81-95 - Jim Blythe, Alexey Tregubov:
FARM: Architecture for Distributed Agent-Based Social Simulations. 96-107
Applications of Massively Multi-agent Systems
- Philip Feldman, Antonio Bucchiarone:
Diversity in Massively Multi-agent Systems: Concepts, Implementations, and Normal Accidents. 111-129 - Yohsuke Murase, Hiroyasu Matsushima, Itsuki Noda, Tomio Kamada:
CARAVAN: A Framework for Comprehensive Simulations on Massive Parallel Machines. 130-143 - Luana Marrocco, Eduardo Castelló Ferrer, Antonio Bucchiarone, Arnaud Grignard, Luis Alonso, Kent Larson, Alex 'Sandy' Pentland:
BASIC: Towards a Blockchained Agent-Based SImulator for Cities. 144-162
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.