Rekayasa Perangkat Lunak Untuk Pemetaan Jalur Kabel Listrik Dengan Menggunakan Algoritma Genetika
Electric cable line mapping as Non-deterministic Polynomial-time Complete (NPC) is difficult to solve using ordinary linier algorithm. In solving the problem there isn't a node encounter twice and route must shortest one, so that it's needed efficiently material. Depend on this problem in...
Saved in:
| 主要作者: | |
|---|---|
| 格式: | Academic Paper |
| 出版: |
2015-05-12T14:03:06Z.
|
| 主题: | |
| 在线阅读: | Get Fulltext |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|