Abstract
A stationary Markov chain model of the agent-based computation system EMAS is presented. The primary goal of the model is better understanding the behavior of this class of systems as well as their constraints. The ergodicity of this chain can be verified for the particular case of EMAS, thus implying an asymptotic guarantee of success (the ability of finding all solutions of the global optimization problem). The presented model may be further adapted to numerous evolutionary and memetic systems. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Byrski, A., Schaefer, R., Smołka, M., & Cotta, C. (2010). Asymptotic analysis of computational multi-agent systems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6238 LNCS, pp. 475–484). https://doi.org/10.1007/978-3-642-15844-5_48
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
