A Mathematical Framework for Cellular Learning Automata
Publish place: 9th Annual Conference of Computer Society of Iran
Publish Year: 1382
نوع سند: مقاله کنفرانسی
زبان: English
View: 2,741
This Paper With 9 Page And PDF Format Ready To Download
- Certificate
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
ACCSI09_035
تاریخ نمایه سازی: 4 بهمن 1386
Abstract:
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.
Authors
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