Tee Wee Jing, Wee Jing (2002) A genetic algorithm solution to the shortest path problem in OSPF and MPLS / by Tee Wee Jing. Masters thesis, Universiti Malaya.
![[img]](http://studentsrepo.um.edu.my/style/images/fileicons/application_pdf.png)
| PDF (Introduction) Download (4Mb) | Preview | |
| PDF (Abstract) Download (675Kb) | Preview | |
| PDF (Table of contents) Download (3740Kb) | Preview | |
| PDF (Chapter 1) Download (4Mb) | Preview | |
| PDF (Chapter 2) Download (21Mb) | Preview | |
| PDF (Chapter 3) Download (14Mb) | Preview | |
| PDF (Chapter 4) Download (26Mb) | Preview | |
| PDF (Chapter 5) Download (1994Kb) | Preview | |
| PDF (Bibliography) Download (5Mb) | Preview |
Official URL: http://www.pendeta.um.edu.my/uhtbin/cgisirsi/x/P01...
| Item Type: | Thesis (Masters) |
|---|---|
| Additional Information: | Dissertation (M.Comp.Sc.) -- Fakulti Sains Komputer dan Teknologi Maklumat, Universiti Malaya, 2002. |
| Uncontrolled Keywords: | Open Shortest Path First (Computer network protocol). Genetic algorithms. |
| Subjects: | Q Science > QA Mathematics > QA76 Computer software |
| Divisions: | Faculty of Computer Science & Information Technology |
| Depositing User: | Cik Hamidah Mohammad Ali |
| Date Deposited: | 15 Apr 2012 14:40 |
| Last Modified: | 24 Jul 2013 16:50 |
| URI: | http://studentsrepo.um.edu.my/id/eprint/2422 |
Actions (For repository staff only : Login required)
| View Item |
