A genetic algorithm solution to the shortest path problem in OSPF and MPLS / by Tee Wee Jing.
Disimpan dalam:
| Pengarang Utama: | |
|---|---|
| Format: | Thesis |
| Diterbitkan: |
2002
|
| Subjek-subjek: | |
| Capaian Atas Talian: | http://www.pendeta.um.edu.my/uhtbin/cgisirsi/x/P01UTAMA/0/5?searchdata1="A genetic algorithm solution to the shortest path problem in OSPF and MPLS"{245} http://www.pendeta.um.edu.my/uhtbin/cgisirsi/x/P01UTAMA/0/5?searchdata1="A genetic algorithm solution to the shortest path problem in OSPF and MPLS"{245} http://studentsrepo.um.edu.my/2422/1/PENDAHULUAN.pdf http://studentsrepo.um.edu.my/2422/2/ABSTRAK.pdf http://studentsrepo.um.edu.my/2422/3/KANDUNGAN.pdf http://studentsrepo.um.edu.my/2422/4/BAB_1.pdf http://studentsrepo.um.edu.my/2422/5/BAB_2.pdf http://studentsrepo.um.edu.my/2422/6/BAB_3.pdf http://studentsrepo.um.edu.my/2422/7/BAB_4.pdf http://studentsrepo.um.edu.my/2422/8/BAB_5.pdf http://studentsrepo.um.edu.my/2422/9/BIBLIOGRAPHI.pdf |
| Penanda-penanda: |
Tambah Penanda
Tiada Penanda, Jadilah orang pertama menanda rekod ini!
|
Jadilah orang pertama meninggalkan komen!