Search Results - intelligence _ ((bayes algorithm) OR (((graph algorithm) OR (path algorithm))))

African Buffalo Optimization (ABO): A New Metaheuristic Algorithm by Odili, Julius Beneoluchi, M. N. M., Kahar

“…This paper proposes a new meta-heuristic approach to solving numerical and graph-based problems. The African buffalo algorithm evolved from an understanding of the animal's survival instincts and the search techniques they utilize in the African forests and savannahs; the search for the optimal path to pasture is aligned to their cooperative, intelligent, and social nature. …”
Get full text
Get full text
Get full text

Industry 5.0 and Education 5.0: Transforming Vocational Education through Intelligent Technology by Zhang, Hongli, Leong, Wai Yie

“…By analyzing the research gaps in personalized learning paths, emotion-driven learning, crossdisciplinary integration, and long-term learning behavior analysis, the paper proposes four improved algorithms: the adaptive learning path generation algorithm, the emotion-driven personalized learning algorithm, the cross-disciplinary knowledge graph algorithm, and the long-term learning behavior prediction algorithm. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Heuristic factors in ant system algorithm for course timetabling problem by Djamarus, Djasli, Ku-Mahamud, Ku Ruhana

Get full text
Get full text

Attack graph construction for enhancing intrusion prediction based on vulnerabilities metrics by Al-Araji, Zaid Jasim Mohammed

“…For this issue, this study proposes using intelligent agents to reduce the reachability time in calculating between the nodes and use the naïve approach prune algorithm to remove unnecessary edges, minimizing the attack graph's complexity. …”
Get full text
Get full text
Get full text
Get full text

A comprehensive overview of classical and modern route planning algorithms for self-driving mobile robots by Wan Daud, Wan Mohd Bukhari, Abu, Nur Syuhadah, Omar, Siti Nashayu, Sohaimeh, Shahirul Ashraf, Adli,, M. H.

“…This evaluation focuses mostly on the accuracy of the different path-planning algorithms. Common collision-free path planning methodologies are examined in this paper, including classical or traditional and modern intelligence techniques, as well as both global and local approaches, in static and dynamic environments. …”
Get full text
Get full text
Get full text

Attack prediction to enhance attack path discovery using improved attack graph by Al-Araji, Zaid Jasim, Abdullah, Raihana Syahirah, Syed Ahmad, Sharifah Sakinah

“…In order to overcome this limitation, this present study recommends the use of intelligent agents to reduce reachability time by calculating between the nodes, as well as using the A*prune algorithm to remove useless edges and reduce attack graph complexity. …”
Get full text
Get full text
Get full text

Utilization of Tabu search heuristic rules in sampling-based motion planning by Khaksar W., Hong T.S., Sahari K.S.M., Khaksar M.

“…We also compare the performance of the algorithm with some of the well-known path planning approaches, including Bug1, Bug2, PRM, RRT and the Visibility Graph. …”

Intelligent guidance parking system using modified Dijkstra's algorithm by Jaafar, Haslina, Zabidi, Muhamad Hidayat, Che Soh, Azura, Thong, Peng Hoong, Shafie, Suhaidi, Ahmad, Siti Anom

“…This paper presents the intelligent parking system which apply Dijkstra’s algorithm in finding the shortest path. …”
Get full text
Get full text
Get full text

A Robust Graph Theoretic Solution of Routing in Intelligent Networks by Qureshi, M.A., Hassan, M.F., Ehsan, M.K., Khan, M.O., Ali, M.Y., Khan, S.

“…The fast construction of shortest-path tree (SPT) is important to devise an efficient routing in a nondelay tolerant networks. …”
Get full text
Get full text

Influence of shortest route approximation on relegating urban area’s transportation network priorities by Farid Morsidi, Haldi Budiman

“…The purpose of this research is to highlight the incorporation of shortest path routing heuristics for maximizing traversable nodes of a round trip distribution cycle, to stretch the qualities of sentient pathfinding capabilities from prominent intelligent graph traversal algorithm specimens to produce prudent output in terms of addressing cost optimality constraints. …”
Get full text
Get full text
Get full text

Naive Bayes-guided bat algorithm for feature selection by Taha A.M., Mustapha A., Chen S.-D.

Subjects: “…Algorithms…”

New algorithm for autonomous dynamic path planning in real-time intelligent robot car by Mohammed, Akeel Ahmed, Hassan, Mohd Khair, Aris, Ishak, Kamsani, Noor Ain

“…Different algorithms have been used to address this problem by considering the optimal path with minimum cost; however, these algorithms did not consider the execution time to find such path. …”
Get full text
Get full text
Get full text

Optimisation of Environmental Risk Assessment Architecture using Artificial Intelligence Techniques by Salem S. M. Khalifa

“…By contrast, the results of the safe path selection model were compared with the results obtained using Dijkstra's algorithm and the Floyd-Warshall algorithm. …”

Intelligent web proxy cache replacement algorithm based on adaptive weight ranking policy via dynamic aging by Olanrewaju, Rashidah Funke, Al-Qudah, Dua'a Mahmoud Mohammad, Azman, Amelia Wong, Yaacob, Mashkuri

“…This work proposes a hybrid method that optimize cache replacement algorithm using Naïve Bayes (NB) based approach. Naïve Bayes is an intelligent method that depends on Bayes’ probability theory integrated with Adaptive Weight Ranking Policy (AWRP) via dynamic aging factor to improve the response time and network performance. …”
Get full text
Get full text
Get full text

Solving the minimum dominating set problem of partitioned graphs using a hybrid bat algorithm by Abed, S.A., Rais, H.M.

“…This paper investigates the swarm intelligence behaviour represented by a population-based approach called the bat algorithm (BA) to find the smallest set of nodes that dominate the graph. …”
Get full text
Get full text

Mobile robot path planning using hybrid genetic algorithm and traversability vectors method by Loo, C.K., Rajeswari, M., Wong, E.K., RaoTask, M.V.C.

“…Recent advances in robotics and machine intelligence have led to the application of modern optimization method such as the genetic algorithm (GA), to solve the path-planning problem. …”
Get full text
Get full text
Get full text

Mobile banking Trojan detection using Naive Bayes / Anis Athirah Masmuhallim by Masmuhallim, Anis Athirah

“…The objectives of this project are to study the requirement of the Naive Bayes algorithm in Mobile Banking Trojan detection, to develop a webbased detection system for Mobile Banking Trojan using Naive Bayes, and to evaluate the performance and accuracy of the Naive Bayes algorithm in the Mobile Banking Trojan detection. …”
Get full text
Get full text

Intelligent cooperative web caching policies for media objects based on J48 decision tree and naïve Bayes supervised machine learning algorithms in structured peer-to-peer systems by Ibrahim, Hamidah, Mohammed, Waheed Yasin, Udzir, Nur Izura, Abdul Hamid, Nor Asilah Wati

“…Moreover, traditional web caching policies such as Least Recently Used (LRU), Least Frequently Used (LFU), and Greedy Dual Size (GDS) suffer from caching pollution (i.e. media objects that are stored in the cache are not frequently visited which negatively affects on the performance of web proxy caching). In this work, intelligent cooperative web caching approaches based on J48 decision tree and Naïve Bayes (NB) supervised machine learning algorithms are presented. …”
Get full text
Get full text
Get full text

A review : On intelligent mobile robot path planning techniques by Muhammad, Aisha, Ali, Mohammad A.H., Shanono, Ibrahim Haruna

“…The artificial intelligence methods such as genetic algorithm (GA), fuzzy logic (FL), ant colony optimization (ACO), neural network (NN), firefly algorithm (FA), particle swarm optimization (PSO), bacterial foraging optimization (BFO), artificial bee colony (ABC), and other miscellaneous algorithms are reviewed. …”
Get full text
Get full text
Get full text
Get full text

Performance Analysis of Swarm Intelligence-Based Routing Protocol for Mobile Ad Hoc Network and Wireless Mesh Networks by Moghanjoughi, Ayyoub Akbari

“…Also the main aim of this research is to solve the freezing problem during optimum as well as sub-optimum path discovery process. In this research, Intelligent AntNet based Routing Algorithm (IANRA) is presented for routing in WMNs and MANET to find optimum and near-optimum paths for data packet routing. …”
Get full text
Get full text