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

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

تعداد صفحات: ۹

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

Hamid Beigy – Soft Computing Laboratory, Computer Engineering Department Amirkabir University of Technology Tehran, Iran
Meybodi – Soft Computing Laboratory, Computer Engineering Department Amirkabir University of Technology Tehran, Iran

چکیده:

In this paper, we first give a formal description for cellular learning automata then study its convergence behavior. It is shown that for permutable rules, the cellular learning automata converges to a stable and compatible configuration. The numerical results also confirms our theoretical investigations.