Graph Partitioning using Artificial Fish Algorithm
محل انتشار: یازدهمین کنفرانس سراسری سیستم های هوشمند
سال انتشار: 1391
نوع سند: مقاله کنفرانسی
زبان: انگلیسی
مشاهده: 949
فایل این مقاله در 5 صفحه با فرمت PDF قابل دریافت می باشد
- صدور گواهی نمایه سازی
- من نویسنده این مقاله هستم
استخراج به نرم افزارهای پژوهشی:
شناسه ملی سند علمی:
ICS11_268
تاریخ نمایه سازی: 14 مهر 1392
چکیده مقاله:
The problem of partitioning graphs connected into balance componentsis used in many computations. This problem is considered a NP-complete problem and since it is very important and has many applications, tools and solutions that have been suggested to it. Some of these solutions are heuristic and approximate algorithms. In this paper, we have used approximate optimization algorithm of artificial fish, which is derived from group behaviour of fish, to tackle this problem. In this algorithm, the behaviour of individual fish and their interactions are used and considerable results can be obtained
کلیدواژه ها:
نویسندگان
Sina Zangbari Kouhi
Aras International Campus, University of Tabriz
Faranak Nejati
Aras International Campus, University of Tabriz
Shahriar Lotfi
Department of Computer Science, University of Tabriz