Search Results - (( java implementation path algorithm ) OR ( using minimum spanning algorithm ))

Outlier detection in circular regression model using minimum spanning tree method by Nur Faraidah, Muhammad Di, Siti Zanariah, Satari, Roslinazairimah, Zakaria

“…Therefore, this study aims to develop new algorithms that can detect outliers by using the minimum spanning tree method. …”
Get full text
Get full text

Some greedy based algorithms for multi periods degree constrained minimum spanning tree problem by Wamiliana, Wamiliana, Elfaki, Faiz Ahmed Mohamed, Usman, Mustofa, Azram, Mohammad

“…In this paper we proposed three algorithms by modifying Kruskal’s and Prim’s algorithms. …”
Get full text
Get full text
Get full text

A matrix approach for minimum spanning tree in neutrosophic and application in medical waste management / Nur Haifa Ahmad Hayazim, Siti Nurain Zulkifli and Siti Nurhidayah Yaacob by Ahmad Hayazim, Nur Haifa, Zulkifli, Siti Nurain, Yaacob, Siti Nurhidayah

“…A numerical example related to finding the optimal route that can minimize the cost of solving the medical waste management is provided to show the effectiveness of the Prim's and Kruskal's algorithms with IVBN. As a final step, a comparative study such as interval-valued neutrosophic minimum spanning tree (IVN-MST), interval-valued intuitionistic fuzzy minimum spanning tree (IVIF-MST) and interval-valued fuzzy minimum spanning tree (IVE-MST) is presented to point out the advantages of the proposed method over that of other existing algorithms. …”
Get full text
Get full text

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

Outlier detection in circular regression model using minimum spanning tree method by Nur Faraidah, Muhammad Di, Siti Zanariah, Satari, Roslinazairimah, Zakaria

“…Therefore, this study aims to develop new algorithms that can detect outliers by using minimum spanning tree method. …”
Get full text
Get full text
Get full text

A minimum spanning tree stock market analysis of Malaysia technology companies by Zulrushdi, Puteri Nur Qistina Megat, Bahaludin, Hafizah, Ibrahim, Siti Nur Iqmal

“…The collected data is the daily closing prices of Malaysia’s top 20 most active companies based on the volume traded in the list of technology companies. The minimum spanning tree was used to construct the network via Kruskal’s algorithm, and the centrality measures of the stocks, such as degree, betweenness, closeness, and eigenvector, were measured to identify influential stocks. …”
Get full text
Get full text
Get full text
Get full text

A new local search algorithm for minimum span frequency assignment in mobile communication by Loh, S.L., Lim, S.P., Chong, S.H., Ching, D.L.C.

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

Using modification of Prim's algorithm and GNU Octave and to solve the multiperiods installation problem by ,, Wamiliana, Usman, Mustofa, ,, Warsono, Daoud, Jamal Ibrahim

“…The Minimum Spanning Tree (MST) is one of the famous problems that is used mostly as the backbone in many network design problems. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Network analysis on safety culture and worker‘s behaviour : A forest of all minimum spanning trees by Djauhari, Maman A., Sharif, Shamshuritawati, Djauhari, Hariza

Get full text
Get full text
Get full text

Mining Sequential Patterns Using I-PrefixSpan by Dhany , Saputra, Rambli Dayang, R.A., Foong, Oi Mean

“…In this paper, we propose an improvement of pattern growth-based PrefixSpan algorithm, called I-PrefixSpan. The general idea of I-PrefixSpan is to use the efficient data structure for general tree-like framework and separator database to reduce the execution time and memory usage. …”
Get full text
Get full text
Get full text

A minimum spanning tree stock market analysis of Malaysia technology companies by Puteri Nur Qistina Megat Zulrushdi, Hafizah Bahaludin, Siti Nur Iqmal Ibrahim

“…The collected data is the daily closing prices of Malaysia’s top 20 most active companies based on the volume traded in the list of technology companies. The minimum spanning tree was used to construct the network via Kruskal’s algorithm, and the centrality measures of the stocks, such as degree, betweenness, closeness, and eigenvector, were measured to identify influential stocks. …”
Get full text
Get full text
Get full text

A minimum spanning tree stock market analysis of Malaysia technology companies by Zulrushdi, Puteri Nur Qistina Megat, Bahaludin, Hafizah, Ibrahim, Siti Nur Iqmal

“…The collected data is the daily closing prices of Malaysia’s top 20 most ac-tive companies based on the volume traded in the list of technology companies. The minimum spanning tree was used to construct the network via Kruskal’s algorithm, and the centrality measures of the stocks, such as degree, betweenness, closeness, and eigenvector, were measured to identify influential stocks. …”
Get full text
Get full text
Get full text

Proportional-integral control optimization using imperialist competitive algorithm by Soheilirad, Mohammadsoroush

“…This implies that the ICA can be used to tune the PI control loops for a continuous stirred tank heater with a minimum cost and better response in compare with the GA and the PSO.…”
Get full text
Get full text

Optimum MV Feeder Routing and Substation siting and rating in Distribution Network by Hasan, Ihsan Jabbar, Ab Ghani, Mohd Ruddin, Gan, Chin Kim

“…This paper proposes an evolutionary algorithm to determine the optimum distribution substation placement and sizing by using the particle swarm optimization algorithm and optimum feeder routing using modified minimum spanning tree algorithm. …”
Get full text
Get full text

An optimal tasks scheduling algorithm based on QoS in cloud computing network by Alhakimi, Mohammed Ameen Mohammed Abdo

“…Therefore, if the resource is from the first group then map the average length task to it and if the choosing resource is from the second group, then map the largest length task to it. The simulation tool used for testing the algorithm is WorkflowSim. We tested averages of execution time span of the proposed algorithm for 10 running times with 200-1000 tasks in 50 or 100 VMs. …”
Get full text
Get full text

Improvement of horizontal streak on disparity map thru parameter optimization for stereo vision algorithm by Gan, Melvin Yeou Wei, Hamzah, Rostam Affendi, Nik Anwar, Nik Syahrim, Herman, Adi Irwan, Jamil Alsayaydeh, Jamil Abedalrahim

“…Next, the cost aggregation uses minimum spanning tree (MST) segmentation, which equipped with edge preserving properties and noise filtering. …”
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