GENETIC ALGORITHMS FOR THE MODULE ORIENTATION PROBLEM
| dc.citation.epage | 1200 | en_US |
| dc.citation.issue | 15 | en_US |
| dc.citation.spage | 1199 | en_US |
| dc.citation.volume | 30 | en_US |
| dc.citation.woscount | 1 | |
| dc.contributor.author | CHANG, RI | en_US |
| dc.contributor.author | HSIAO, PY | en_US |
| dc.contributor.department | 交大名義發表 | zh_TW |
| dc.contributor.department | 資訊工程學系 | zh_TW |
| dc.contributor.department | National Chiao Tung University | en_US |
| dc.contributor.department | Department of Computer Science | en_US |
| dc.date.accessioned | 2014-12-08T15:03:52Z | |
| dc.date.available | 2014-12-08T15:03:52Z | |
| dc.date.issued | 1994-07-21 | en_US |
| dc.description.abstract | To solve the module orientation problem the optimal number of flips of modules needs to be determined so as to minimise total wire length. A genetic-based module orientation method is proposed. Experiments show that the proposed method performs better than the best method known for this problem. | en_US |
| dc.identifier.doi | 10.1049/el:19940837 | en_US |
| dc.identifier.issn | 0013-5194 | en_US |
| dc.identifier.journal | ELECTRONICS LETTERS | en_US |
| dc.identifier.uri | http://dx.doi.org/10.1049/el:19940837 | en_US |
| dc.identifier.uri | https://ir.lib.nycu.edu.tw/handle/11536/2402 | |
| dc.identifier.wosnumber | WOS:A1994PA87100006 | |
| dc.language.iso | en_US | en_US |
| dc.subject | CIRCUIT LAYOUT CAD | en_US |
| dc.subject | GENETIC ALGORITHMS | en_US |
| dc.title | GENETIC ALGORITHMS FOR THE MODULE ORIENTATION PROBLEM | en_US |
| dc.type | Article | en_US |