An application of two different algorithms on the same network

dc.authorid0000-0001-7697-3579en_US
dc.contributor.authorErdogan, Şenol Zafer
dc.contributor.authorEsin, E. Murat
dc.date.accessioned2024-07-12T20:58:08Z
dc.date.available2024-07-12T20:58:08Z
dc.date.issued2006en_US
dc.departmentFakülteler, Mühendislik ve Doğa Bilimleri Fakültesi, Bilgisayar Mühendisliği Bölümüen_US
dc.description2006 International Symposium on Communications and Information Technologies, ISCIT -- 18 October 2006 through 20 October 2006 -- Bangkok -- 73067en_US
dc.description.abstractIn 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.citationErdoğ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-1166en_US
dc.identifier.doi10.1109/ISCIT.2006.339963
dc.identifier.endpage1166en_US
dc.identifier.scopus2-s2.0-50949098134en_US
dc.identifier.startpage1162en_US
dc.identifier.urihttps://dx.doi.org/10.1109/ISCIT.2006.339963
dc.identifier.urihttps://hdl.handle.net/20.500.12415/3143
dc.indekslendigikaynakScopus
dc.language.isoenen_US
dc.relation.ispartof2006 International Symposium on Communications and Information Technologies, ISCITen_US
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.snmzKY06470
dc.subjectAnt colony systemen_US
dc.subjectComputer networksen_US
dc.subjectSelf cloning anten_US
dc.subjectShortest pathen_US
dc.titleAn application of two different algorithms on the same networken_US
dc.typeConference Object
dspace.entity.typePublication

Dosyalar