Search Results - (( develop computer ((graph algorithm) OR (path algorithm)) ) OR ( java implication _ algorithm ))

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

“…Graphs are pervasive data structures in computer science, and algorithms working with them are fundamental to the field. …”
Get full text
Get full text
Get full text

Computationally-efficient path planning algorithms in obstacle-rich environments based on visibility graph method by Abdul Latip, Nor Badariyah

“…Cun·ent studies have been focused on developing path planning algorithms to satisfy the criteria of path planning namely minimum path length, low computation time and complete, i.e., it gives positive result if a path is available or negative if otherwise. …”
Get full text
Get full text
Get full text
Get full text

Path planning for unmanned aerial vehicles using visibility line-based methods by Omar, Rosli

“…In order to ensure that the 3D path planning algorithms are computationally efficient, the proposed 2D path planning algorithms are applied into them. …”
Get full text
Get full text

Investigating and developing the best method in shortest path for implementing a geographical information system (e-map) for Peninsular Malaysia by Ahmad, Ab. Rahman, Zenon , Nasaruddin, Hassan, Haswadi

“…Assessment will be done by calculating the algorithm complexion and runtime using the computer. …”
Get full text
Get full text

An improved algorithm in test case generation from UML activity diagram using activity path by Hashim, Nor Laily, Salman, Yasir D.

Get full text
Get full text
Get full text

Test case minimization applying firefly algorithm by Hashim, Nor Laily, Dawood, Yasir Salman

Get full text
Get full text
Get full text

Quantum Processing Framework And Hybrid Algorithms For Routing Problems by Soltan Aghaei, Mohammad Reza

“…Another quantum algorithm for a minimum weight spanning tree in the graph was also designed. …”
Get full text
Get full text

High Rise Building Evacuation Route Model Using DIJKSTRA'S Algorithm by Mohd Sabri, Nor Amalina

Get full text
Get full text
Get full text
Get full text

Laser simulator: a novel search graph-based path planning approach by Ali, Mohammed A. H., Musa, Mailah

“…A novel technique called laser simulator approach for visibility search graph-based path planning has been developed in this article to determine the optimum collision-free path in unknown environment. …”
Get full text
Get full text
Get full text

Energy efficient path-planning for unmanned aerial vehicle by Debnath, Sanjoy Kumar

“…The proposed path planning algorithm is called Iterative Elliptical- Convex Visibility Graph (IECoVG) which is based on visibility graph (VG) and Dijkstra’s algorithm. …”
Get full text
Get full text
Get full text
Get full text

Recent research in cooperative path planning algorithms for multi-agent using mixed- integer linear programming by Che Ku, Nor Azie Hailma, Omar, Rosli, Sabudin Elia Nadira, Sabudin Elia Nadira

“…Path planning is one of the issues to be handled in the development of autonomous systems. …”
Get full text
Get full text

Implementation of laser simulator in robot path determination by Zenas, Chung Han Yuan

“…From this research, the laser simulator has advantages in computational time and low collision possibility compare with A* algorithm while the path cost of laser simulator is always greater than path cost of A* algorithm.…”
Get full text
Get full text

Global Mobile Robot Path Planning using Laser Simulator by Ali, Mohammed A. H., Wan Azhar, Wan Yusoff, Zamzuri, Hamedon, Zulkifli, Md. Yusof, Musa, Mailah

“…From the results, the laser simulator has advantages in computational time and low collision possibility in comparison with A* algorithm while the path cost of laser simulator is always greater than path cost of A* algorithm.…”
Get full text
Get full text
Get full text
Get full text

Dijkstra’s algorithm in Product Searching System (ProSearch) / Nur Hasni Nasrudin ... [et al.] by Nasrudin, Nur Hasni, Nasaruddin, Siti Hajar, Syed Abdul Halim, Syarifah Syafiqah Wafa, Ahmad Junid, Rosida

Get full text
Get full text

Discrete simulation framework for wireless cellular networks. by Al-Sanabani, Maher Ali, K. Subramaniam, Shamala, Othman, Mohamed, Ahmad Zulkarnain, Zuriati

Get full text
Get full text

Boolean routing on high degree chordal ring networks by Matroud Bashi, Atheer Abbas

“…O(1) time complexity to compute a shortest path to any destination for the ring topologies has been shown. …”
Get full text
Get full text

Design of DNA fragment assembly using IWP method on application-specific integrated-circuit / Hasniliati Hassan by Hassan, Hasniliati

“…After reviewing various algorithms, it was decided to apply de Bruijn graphs and Eulerian circuits that are based on graph theory. …”
Get full text
Get full text

A test case generation framework based on UML statechart diagram by Salman, Yasir Dawood

Get full text
Get full text
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

“…Furthermore, the review highlights key challenges such as handling dynamic multi-agent environments, managing interactions with human-driven vehicles, and balancing computational efficiency with path optimality and discusses potential solutions through adaptive, real-time algorithms, cooperative planning, and predictive modelling. …”
Get full text
Get full text
Get full text

Implementation of motion planning and active force control to a virtual wheeled mobile robot by Tang, Howe Hing

“…The motion path planning is based on the A*heuristic search algorithm with a specific reference to the sixelementary jumps graph for the generation of a nonholonomic global collision-free path environment. …”
Get full text
Get full text