سال انتشار: ۱۳۸۳

محل انتشار: دهمین کنفرانس سالانه انجمن کامپیوتر ایران

تعداد صفحات: ۱۰

نویسنده(ها):

hamid beigy – computer engineering department sharif university of technology
m.r meybodi – soft computing laboratory computer engineering department amirkabir university of tech

چکیده:

in this paper we introduce asynchronous cellular learning automata and then study its convergence behavior. It is shown that for class of rules called commutative rules the asynchronous cellular learning automata converges to a stable and compatible configuation the numerical results also confirms the theory