Abstract
The paper extends the formal model of a computing Multi Agent System introduced in our previous papers to the case in which the background load coming from operating systems activities as well as other applications is included. Results concerning the existence of the optimal scheduling strategy as well as the characterization of such strategies have been obtained. The theorems partially verify scheduling heuristics (diffusion rules) designed and tested for large scale CAE computations. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Smołka, M., & Schaefer, R. (2006). Computing MAS dynamics considering the background load. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3993 LNCS-III, pp. 799–806). Springer Verlag. https://doi.org/10.1007/11758532_104
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
