Follow
Mahdi (Mehdi) Ghorbani
Mahdi (Mehdi) Ghorbani
Faculty of Computer and Information Technology Engineering, Qazvin Islamic Azad University
Verified email at qiau.ac.ir
Title
Cited by
Cited by
Year
A new version of k-random walks algorithm in peer-to-peer networks utilizing learning automata
M Ghorbani, MR Meybodi, AM Saghiri
Information and Knowledge Technology (IKT13), 2013 5th Conference on,, 1-6, 2013
152013
A novel self-adaptive search algorithm for unstructured peer-to-peer networks utilizing learning automata
M Ghorbani, MR Meybodi, AM Saghiri
AI & Robotics and 5th RoboCup Iran Open International Symposium (RIOS), 2013 …, 2013
122013
A Novel Learning Based Search Algorithm for Unstructured Peer-to-Peer networks
M Ghorbani, AM Saghiri, MR Meybodi
Technical Journal of Engineering and Applied Sciences 3 (2), 145-149, 2013
92013
An architecture for managing Internet of Things based on cognitive Peer-to-peer networks
M Ghorbani, MR Meybodi, AM Saghiri
2019 5th International Conference on Web Research (ICWR), 111-116, 2019
32019
A novel adaptive version of AODV routing protocol based on learning automata utilizing cognitive networks concept
M Ghorbani, AM Saghiri, MR Meybodi
Technical Journal of Engineering and Applied Sciences 3 (22), 3064-3070, 2013
32013
An adaptive topology management algorithm in P2P networks based on learning automata
M Ghorbani, MR Meybodi, AM Saghiri
2019 7th Iranian Joint Congress on Fuzzy and Intelligent Systems (CFIS), 1-4, 2019
22019
Isa: an intelligent search algorithm for peer-to-peer networks
M Ghorbani, M Jooyan, M Safarpour
Intelligent Computing, Networking, and Informatics, 463-472, 2014
12014
An Adaptive K-random Walks Method for Peer-to-Peer Networks
M Ghorbani
Advances in Computer Science: An International Journal 2 (2), 7-12, 2013
12013
Technical Journal of Engineering and Applied Sciences
M Ghorbani, AM Saghiri, MR Meybodi
2013
Cloud, Grid and Custer Computing
M Ghorbani, MR Meybodi, AM Saghiri, FK Khalaji, M Analoui
The system can't perform the operation now. Try again later.
Articles 1–10