An application of two different algorithms on the same network
Küçük Resim Yok
Tarih
2006
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
In this study, Dijkstra algorithm and self cloning ant colony approach are explained. Dijkstra is a well known algorithm to find the shortest path. Self cloning ant colony approach is a new method to find the optimal path between the pair of the nodes in an unknown net topology. Both methods are applied on the same network and the results and differences are shown. © 2006 IEEE.
Açıklama
2006 International Symposium on Communications and Information Technologies, ISCIT -- 18 October 2006 through 20 October 2006 -- Bangkok -- 73067
Anahtar Kelimeler
Ant colony system, Computer networks, Self cloning ant, Shortest path
Kaynak
2006 International Symposium on Communications and Information Technologies, ISCIT
WoS Q Değeri
Scopus Q Değeri
Cilt
Sayı
Künye
Erdoğan, Ş. Z. ve Esin, E.M. (2006). An application of two different algorithms on the same network. 2006 International Symposium on Communications and Information Technologies, ISCIT. s. 1162-1166
