Performance of list scheduling for set partition problems
碩士 === 樹德科技大學 === 資訊工程學系 === 94 === An m-partition of a set is a way to distribute the numbers into m parts. Given a set of positive numbers, an optimal m-partition problem asks for an m-partition optimizing some objective function. List scheduling is an on-line algorithm that has been widely used i...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2006
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/12943695466142897035 |