Overview
- Includes a full formal analysis of evolutionary multi-agent systems (EMAS)
- Provides a literature review and explores the motivation and definition of the systems considered
- Explains the design and implementation of the platforms supporting EMAS-like computations
- Presents experimental results obtained by applying EMAS and some of its modifications to solve discrete and continuous problems
- Explores the possibilities of adapting particular EMAS parameters to solve benchmarking problems of varying difficulty
- Includes supplementary material: sn.pub/extras
Part of the book series: Studies in Computational Intelligence (SCI, volume 680)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (8 chapters)
-
Concept and Formal Model
-
Design and Implementation
-
Experimental Results
Keywords
About this book
Readers will benefit from the insightful discussion, which primarily concerns the efficient implementation of computing frameworks for developing EMAS and similar computing systems, as well as a detailed formal model. Theoretical deliberations demonstrating that computing with EMAS always helps to find the optimal solution are also included, rounding out the coverage.
Authors and Affiliations
Bibliographic Information
Book Title: Evolutionary Multi-Agent Systems
Book Subtitle: From Inspirations to Applications
Authors: Aleksander Byrski, Marek Kisiel-Dorohinicki
Series Title: Studies in Computational Intelligence
DOI: https://doi.org/10.1007/978-3-319-51388-1
Publisher: Springer Cham
eBook Packages: Engineering, Engineering (R0)
Copyright Information: Springer International Publishing AG 2017
Hardcover ISBN: 978-3-319-51387-4Published: 02 January 2017
Softcover ISBN: 978-3-319-84637-8Published: 30 April 2018
eBook ISBN: 978-3-319-51388-1Published: 21 December 2016
Series ISSN: 1860-949X
Series E-ISSN: 1860-9503
Edition Number: 1
Number of Pages: XIV, 210
Number of Illustrations: 77 b/w illustrations
Topics: Computational Intelligence, Artificial Intelligence, Algorithm Analysis and Problem Complexity