The Ability of Learning Automata in Solving Constraint Satisfaction Problems
عنوان مقاله: The Ability of Learning Automata in Solving Constraint Satisfaction Problems
شناسه ملی مقاله: ICEE11_022
منتشر شده در یازدهمین کنفرانس مهندسی برق در سال 1382
شناسه ملی مقاله: ICEE11_022
منتشر شده در یازدهمین کنفرانس مهندسی برق در سال 1382
مشخصات نویسندگان مقاله:
P. Bahri - Soft Computing Laboratory Computer Engineering and Information Technology Department Amirkabir University of Technology
M. R. Meybodi
خلاصه مقاله:
P. Bahri - Soft Computing Laboratory Computer Engineering and Information Technology Department Amirkabir University of Technology
M. R. Meybodi
In this paper we have investigated the performance of some stochastic methods for solving constraint satisfaction (CSP) and fuzzy constraint satisfaction problems (FCSP). The purpose of this paper is to study the abilities of learning automaton in solving these problems and comparing it with other stochastic methods. The results confirm those of [2] and show its superiority to other methods.
کلمات کلیدی: CSP, FCSP, Learning Automaton, Stochastic Algorithms, Genetic Algorithms
صفحه اختصاصی مقاله و دریافت فایل کامل: https://civilica.com/doc/152028/