A modified PSO with fuzzy inference system for solving the planar graph coloring problem
There are several optimization problems with number of feasible solution is polynomial bounded by the size of the given input instances. Graph Coloring is a classic NP-hard problem; hence, it is theoretically of great importance. Diverse applications of Graph Coloring have made the scientific commun...
Disimpan dalam:
| Pengarang Utama: | |
|---|---|
| Format: | Thesis |
| Bahasa: | English |
| Diterbitkan: |
2010
|
| Subjek-subjek: | |
| Capaian Atas Talian: | http://eprints.utm.my/16547/ http://eprints.utm.my/16547/7/MostafaErfaniMFSKSM2010.pdf |
| Penanda-penanda: |
Tambah Penanda
Tiada Penanda, Jadilah orang pertama menanda rekod ini!
|
Jadilah orang pertama meninggalkan komen!