Search Results - (( its application ((graph algorithm) OR (path algorithm)) ) OR ( _ application a algorithm ))*

IMPLEMENTATION OF GRAPH BASED PATH PLANNING ALGORITHMS FOR INDOOR NAVIGATION by SYED KHAIZURA, SYED HUSEIN KAMIL

“…Thus, the A* algorithm is implemented in a small mobile robot, this is to see its effectiveness in real world application. …”
Get full text
Get full text

Graph processing hardware accelerator for shortest path algorithms in nanometer very large-scale integration interconnect routing by Ch'ng, Heng Sun

Get full text
Get full text
Get full text

Modeling dynamic weight for 3D navigation routing by Musliman, Ivin Amri, Abdul Rahman, Alias, Coors, Volker

“…Currently, most of shortest path algorithm used in GIS application is often not sufficient for efficient management in time-critical applications such as emergency response applications. …”
Get full text
Get full text

High-Speed shortest path co-processor design by Idris, Mohd Yamani Idna, Abu Bakar, Suraya, Tamil, Emran Mohd, Razak, Zaidi, Noor, Noorzaily Mohamed

“…Shortest path algorithms are significant in graph theory and have been applied in many applications such as transportation and networking. …”
Get full text
Get full text

Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences by Rajesvary Rajoo R., Salam R.A.

An experiment on the performance of shortest path algorithm by Chan, Simon Yew Meng, Adnan, Nur’ayuni, Sukri, Syazwan Syafiqah, Wan Zainon, Wan Mohd Nazmee

Get full text
Get full text
Get full text

Graph-Based Algorithm With Self-Weighted And Adaptive Neighbours Learning For Multi-View Clustering by He, Yanfang

“…To address this issue, this study incorporated joint graph learning from the gmc algorithm into swmcan, creating a new algorithm called swmcan-jg. …”
Get full text
Get full text

Comparison of path planning in simulated robot by Ch’ng, Chee Yu’ng

“…This is because each path planning algorithm has its own applicable domain, performance, advantages and disadvantages in various situations. …”
Get full text
Get full text

Communication in Chordal Ring Networks by Matroud, Atheer Abbas

Get full text
Get full text

Max degree around (MDA) algorithm: a smart and efficient approximate algorithm for Vertex cover and independent set problems by Fayaz, Muhammad, Arshad, S, Shah, A.S, Shah, Asadullah

“…The aim of this paper is twofold: first to investigate failures of the state-of- the-art algorithms for MVC problem on small graphs and second to propose a simple and efficient approximation algorithm for the minimum vertex cover problem. …”
Get full text
Get full text
Get full text

Simulation of shortest path using a-star algorithm / Nurul Hani Nortaja by Nurul Hani , Nortaja

“…This thesis also provides an explanation about the advantages. functions, characteristics. the degree of complexity in A • algorithm and its implementation in real-world application. …”
Get full text
Get full text

Identification of power poles based on satellite stereo images using graph-cut algorithm by Qayyum, Abdul, Malik, Aamir Saeed, Mohamad Saad, Mohamad Naufal, Ahmad, Rana Fayyaz, Taun Abdullah, Taun Ab Rashid

Get full text
Get full text

Mobile robot path optimization algorithm using vector calculus and mapping of 2 dimensional space by Zahari, Ammar, Ismail , Amelia Ritahani, Desia, Recky

Get full text
Get full text
Get full text

Performance comparison of a and Dijkstra algorithms with bézier curve in 2D grid and OpenStreetMap scenarios by Yusuf, Zakariah, Mohamad, Sufian, Wan Ibrahim, Wan Suhaifiza

“…This paper presents a comparative study of the A* and Dijkstra algorithms for path planning in both 2D grid maps and real-world OpenStreetMap (OSM) environments. …”
Get full text
Get full text
Get full text

Path planning for constant speed robot by Abdullah @ Idris, Ahmad Takiyuddin

Get full text
Get full text

Path planning methods for autonomous vehicles at intersections: A review by Vinayak, Akhil, Muhammad Aizzat, Zakaria, Younus, Maryam, Mohamad Heerwan, Peeie, Muhammad Izhar, Ishak

“…Each method is analysed in terms of its strengths, limitations, and applicability to real-world scenarios, focusing on the specific demands of intersection navigation. …”
Get full text
Get full text
Get full text

A 'snowflake' geometrical representation for optimised degree six 3-modified chordal ring networks by Chien, Stephen Lim Een, Raja Maamor Shah, Raja Noor Farah Azura, Othman, Mohamed

Get full text
Get full text

An Improved-Time Polynomial-Space Exact Algorithm For TSP In Degree-5 Graphs by Md Yunos, Norhazwani, Shurbevski, Aleksandar, Nagamochi, Hiroshi

“…The Traveling Salesman Problem (TSP) is one of the most well-known NP-hard optimization problems. Following a recent trend of research which focuses on developing algorithms for special types of TSP instances, namely graphs of limited degree, in an attempt to reduce a part of the time and space complexity, we present a polynomial-space branching algorithm for the TSP in an n-vertex graph with degree at most 5, and show that it has a running time of O∗(2.3500n), which improves the previous best known time bound of O∗(2.4723n) given by the authors (the 12th International Symposium on Operations Research and Its Application (ISORA 2015), pp.45–58, 2015). …”
Get full text
Get full text
Get full text
Get full text

Enhancement of Ant System Algorithm for Course Timetabling Problem by Djamarus, Djasli

Get full text
Get full text
Get full text

Link utilization of GA-based QoS routing algorithm by Yussof S., See O.H.

“…In the previous work, a GA-based QoS routing algorithm has been proposed and the performance of the algorithm with respect to its ability to a find a feasible path has been evaluated. …”