An application of two different algorithms on the same network
dc.authorid | 0000-0001-7697-3579 | en_US |
dc.contributor.author | Erdogan, Şenol Zafer | |
dc.contributor.author | Esin, E. Murat | |
dc.date.accessioned | 2024-07-12T20:58:08Z | |
dc.date.available | 2024-07-12T20:58:08Z | |
dc.date.issued | 2006 | en_US |
dc.department | Fakülteler, Mühendislik ve Doğa Bilimleri Fakültesi, Bilgisayar Mühendisliği Bölümü | en_US |
dc.description | 2006 International Symposium on Communications and Information Technologies, ISCIT -- 18 October 2006 through 20 October 2006 -- Bangkok -- 73067 | en_US |
dc.description.abstract | 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. | en_US |
dc.identifier.citation | 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 | en_US |
dc.identifier.doi | 10.1109/ISCIT.2006.339963 | |
dc.identifier.endpage | 1166 | en_US |
dc.identifier.scopus | 2-s2.0-50949098134 | en_US |
dc.identifier.startpage | 1162 | en_US |
dc.identifier.uri | https://dx.doi.org/10.1109/ISCIT.2006.339963 | |
dc.identifier.uri | https://hdl.handle.net/20.500.12415/3143 | |
dc.indekslendigikaynak | Scopus | |
dc.language.iso | en | en_US |
dc.relation.ispartof | 2006 International Symposium on Communications and Information Technologies, ISCIT | en_US |
dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
dc.rights | info:eu-repo/semantics/closedAccess | en_US |
dc.snmz | KY06470 | |
dc.subject | Ant colony system | en_US |
dc.subject | Computer networks | en_US |
dc.subject | Self cloning ant | en_US |
dc.subject | Shortest path | en_US |
dc.title | An application of two different algorithms on the same network | en_US |
dc.type | Conference Object | |
dspace.entity.type | Publication |