Search Results - (( solution connection based algorithm ) OR ( java implementation path algorithm ))

Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

“…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
Get full text
Get full text

Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

“…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
Get full text
Get full text

Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

“…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
Get full text
Get full text
Get full text
Get full text

Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

“…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
Get full text
Get full text

Sizing optimization of large-scale grid connected photovoltaic system using dolphin echolocation algorithm / Muhammad Zakyizzuddin Rosselan by Rosselan, Muhammad Zakyizzuddin

“…Later, an Iterative-based Sizing Algorithm (ISA) was developed to determine the optimal sizing solution which was later used as benchmark for sizing algorithms using optimization methods. …”
Get full text
Get full text

Enhancing Market-Based Scheduling Algorithm on Globally Distributed Web Servers Using Least Suitable Sealed Bid Technique by Al-Ewiwi, Mahmoud

“…Scheduling of a multiple distributed servers is considered as a complex problem.considered as NP-complete problem,where no single efficient algorithm guaranteed to produce optimal results.This thesis investigates on how to find optimal solution for distribute system,by implementing market based scheduling Algorithm(MBSA).On implementing the MBSA, a new auction technique which is the least suitable sealed bid auction will be introduced.it is found that least suitable sealed bid technique will give the close-to-optimum solution.In the implementation, cooperative agents were used as a middleware between web servers and stand-alone schedulers. …”
Get full text
Get full text

An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network by Noraziah, Adzhar, Shaharuddin, Salleh

“…We start our algorithm by designing shortest path algorithm based on Dijkstra's method. …”
Get full text
Get full text
Get full text

Routing problem in rectangular mesh network using Dijkstra’s based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

“…Therefore, developing a shortest path based routing algorithm is in need. In this research, Dijkstra’s algorithm is used to establish the shortest connection for each net. …”
Get full text
Get full text
Get full text

Routing problem in rectangular mesh network using shortest path based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

“…Therefore, developing a shortest path based routing algorithm is in need. In this research, Dijkstra's algorithm is used to establish the shortest connection for each net. …”
Get full text
Get full text
Get full text

An Adaptive Switching Cooperative Source Searching And Tracing Algorithms For Underwater Acoustic Source Localization by Majid, Mad Helmi Ab.

“…In order to optimize search space exploration and to maintain inter-robot communication connectivity at swarm level, a dispersion algorithm based on attraction and repulsion force is proposed. …”
Get full text
Get full text

A new approach for convert multiply-connected trees in Bayesian networks by Hussein, Baloochian, Alireza, Khantimoory, Saeed, Balochian

Get full text

Secured Autonomous Agent-Based Intrusion Detection System (SAAIDS) by Luqmanulhakim Mohd Nasir

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

“…The BA explores a wide area of the search space; thus, it is capable of the diversification procedure. However, population-based algorithms are not good in exploiting the search space in comparison to single-solution based methods, therefore, we included the Simulated annealing (SA) algorithm to balance between exploitation and exploration in order to reach a best possible solution. …”
Get full text
Get full text

Routing problem in rectangular mesh network using shortest path based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

“…Therefore, developing a shortest path based routing algorithm is in need. In this research, Dijkstra's algorithm is used to establish the shortest connection for each net. …”
Get full text
Get full text
Get full text

Implication of image processing algorithm in remote sensing and GIS applications by Pathan, Mubeena, Jusoff, Kamaruzaman, Mohd Sood, Alias, Razali, Yaakob, Qureshi, Barkatullah

“…Greedy algorithms expresses as a simple solution algorithm that choose a local optimum solution at each step to achieve a global optimum. …”
Get full text
Get full text
Get full text

Intelligent sizing and output prediction techniques for grid-connected photovoltaic system / Shahril Irwan Sulaiman by Sulaiman, Shahril Irwan

“…Initially, two intuitive-based sizing algorithms for GCPV system design, termed as Conventional Sizing Algorithm (CSA), were developed based on two design goals. …”
Get full text
Get full text

Resource allocation algorithm for improving performance of the OFDMA based connection oriented networks by Saadat, Md Nazmus, Mohd Ali, Borhanuddin, Sali, Aduwati, Raja Abdullah, Raja Syamsul Azmir, Mohamad, Hafizal

Get full text
Get full text
Get full text

Shortest Path Trajectory System Based on Dijkstra Algorithm by Putri, Indah Pratiwi

“…In the master project, the researcher discussed the shortest path solution to a single source problem based on Dijkstra algorithm as resolving the basic concepts. …”
Get full text
Get full text
Get full text
Get full text

Spectrum aware clustering algorithm based on fuzzy logic for sensor based monitoring application / Noorhayati Mohamed Noor …[et al.] by Mohamed Noor, Noorhayati, Md Din, Norashidah, Kasiran, Zolidah, Khalid, Nor Azimah, Abdullah, Shapina

“…The cluster formation is based on the relative channel availability between the cluster member (CM) and CH to ensure stable cluster connectivity from link failure. …”
Get full text
Get full text
Get full text

Handoff Scheme for Terrestrial Mobile and Satellite Convergence Networks with Incorporation of Pattern Recognition Algorithm by Kwong, Chiew Foong

“…Recently there has been many works done to replace the traditional handoff decision algorithm such as hysteresis and fuzzy logic based handoff algorithm, especially in the heterogeneous environment. …”
Get full text
Get full text