Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 2

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  agent-based computation
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
The mathematical model of the biologically inspired, memetic, agent-based computation systems EMAS and iEMAS conformed to BDI standard is presented. The state of the systems and their dynamics are expressed as stationary Markov chains. Such an approach allows to better understand their complex behavior as well as their limitations.
EN
The refined model for the biologically inspired agent-based computation systems EMAS and iEMAS conforming to the BDI standard is presented. Moreover, their evolution is expressed in the form of the stationary Markov chains. This paper generalizes the results obtained by Byrski and Schaefer [7] to a strongly desired case in which some agents’ actions can be executed in parallel. In order to find the Markov transition rule, the precise synchronization scheme was introduced, which allows to establish the stepwise stochastic evolution of the system. The crucial feature which allows to compute the probability transition function in case of parallel execution of local actions is the commutativity of their transition operators. Some abstract conditions expressing such a commutativity which allow to classify the agents’ actions as local or global are formulated and verified in a very simple way. The above-mentioned Markov model constitutes the basis of the asymptotic analysis of EMAS and iEMAS necessary to evaluate their search possibilities and efficiency.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.