Orthogonal Particle Swarm Optimization for Task Assignment Problems
碩士 === 逢甲大學 === 資訊工程所 === 92 === It is very important to design a distributed system by efficiently assigning tasks to proper processors for advancing system performance. The task assignment problem is an NP-complete problem. In this thesis, a novel orthogonal particle swarm optimization (OPSO) for...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2004
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/20267189765809995582 |