Search Results - (( based spanning tree algorithm ) OR ( java implication based algorithm ))

Wireless sensor nodes deployment using multi-robot based on improved spanning tree algorithm by Arezoumand, Reza

“…Developing an exploration algorithm based on spanning tree is the main contribution. …”
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

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 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

Efficient terrain coverage for deploying wireless sensor nodes on multi-robot system by Arezoumand, Reza, Mashohor, Syamsiah, Marhaban, Mohammad Hamiruce

“…Developing an exploration algorithm based on spanning tree is the main contribution and this exploration algorithm is performing fast localization of sensor nodes in energy efficient manner. …”
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

“…We show that the current practice, based on a minimal spanning tree (MST), to filter the information contained in the network is not robust.A robust filter based on the forest of all possible MSTs is then proposed and used to analyze the network. …”
Get full text
Get full text
Get full text

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

“…In this paper, we propose an improvement of pattern growth-based PrefixSpan algorithm, called I-PrefixSpan. …”
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 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 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

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. …”
Get full text
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

“…In this paper, an improved local based stereo vision disparity map (SVDM) algorithm is proposed. …”
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

“…Minimum Spanning Tree (MST), the most functional algorithm, described exclusively by the undirected graph in which all nodes are connected. …”
Get full text
Get full text
Get full text

Energy efficiency mechanism using mobile-based fermat's spiral in wireless sensor networks by Mantoro, Teddy, Shaukat Ali, Haroon, Ayu, Media Anugerah, Usino, Wendi

“…Both ways will try to reduce the famous bottleneck problem that cause wireless sensor nodes energy nearest to base station depleted very quickly. We evaluated the performance of wireless sensor network using minimum spanning tree algorithm specifically Prim’s Algorithm in order to know the bottleneck effect on wireless sensor network and propose a better solution performance based on Fermat Spiral model. …”
Get full text
Get full text
Get full text

A proposed algorithm of random vector in measuring similarity for network topology of Bursa Malaysia by Lim, San Yee

“…Hence, to ease the calculation process and improve the computational efficiency of RV coefficient, an algorithm is proposed. The proposed algorithm is able to measure the similarities among all pairs of stocks in Bursa Malaysia at once. …”
Get full text
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

Near-infrared spectroscopy modeling of combustion characteristics in chip and ground biomass from fast-growing trees and agricultural residue by Shrestha, Bijendra, Posom, Jetsada, Pornchaloempong, Pimpen, Sirisomboon, Panmanas, Shrestha, Bim Prasad, Ariffin, Hidayah

“…Five distinct PLSR-based models were developed using 115 biomass samples for both chip and ground forms, spanning the wavenumber range of 3595–12,489 cm−1. …”
Get full text
Get full text
Get full text

Modeling of static and dynamic components of bio-nanorobotic systems by Gavgani, Hamidreza Khataee

“…In addition, a graph algorithm based on greedy methods is employed to compute a new set of optimal weighted electronic properties of the fullerenes via computing their Minimum Weight Spanning Trees (MWSTs). …”
Get full text
Get full text

Disparity map algorithm for stereo matching process using local based method by Gan, Melvin Yeou Wei

“…Second stage, the Minimum Spanning Tree (MST) is utilised to remove noise from the initial disparity map. …”
Get full text
Get full text
Get full text
Get full text

Efficient flow-based channel assignment schemes for congestion avoidance in wireless mesh networks by Abdulla Mogaibel, Hassen Abd-Almotaleb

“…In addition, a hybrid interface assignment strategy is developed based on the spanning tree structure of the gateway traffic. …”
Get full text
Get full text

The implications for ahybrid detection technique against malicious sqlattacks on web applications by Bahjat Arif, Sarajaldeen Akram, Wani, Sharyar

Get full text
Get full text
Get full text

Electricity distribution network for low and medium voltages based on evolutionary approach optimization by Hasan, Ihsan Jabbar

“…This thesis proposes an algorithm to find the optimum distribution substation placement and sizing by utilizing the PSO algorithm and optimum feeder routing using modified Minimum Spanning Tree (MST). …”
Get full text
Get full text
Get full text
Get full text