An algorithm is proposed for scheduling dependent tasks in time-varying heterogeneous multiprocessor systems, in which computational power and links between processors are allowed to change over time. Link contention is ...

مسئله فروشنده دوره گرد یکی از مسائل NP-Complete در حوزه مسایل بهینه سازی ترکیباتی می باشد الگوریتم های ژنتیک برای حل این مسئله نسبت به روش های متداول بسیار کاراتر می باشند. تا کنون عملگرها و روش های مختلفی برای بهبود کارایی ...

Task scheduling is an essential aspect of parallel processing system. This problem assumes fully connected processors and ignores contention on the communication links. However, as arbitrary processor network (APN), ...

In this paper we propose a multi-agent architecture for web information retrieval using fuzzy logic based result fusion mechanism. The model is designed in JADE framework and takes advantage of JXTA agent communication ...