Search Results - ((((((drop algorithm) OR (graph algorithm))) OR (tree algorithm))) OR (_ algorithm))

A quantum algorithm for minimal spanning tree by Aghaei, Mohammad Reza Soltan, Ahmad Zukarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin

“…Classical algorithms involve searching over some space for finding the minimal spanning tree problem in a graph. …”
Get full text
Get full text

Synthesis of transistor-chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan by Misnan, Azizi

“…This bound enables us to prune the search tree efficiently. The algorithm will be implemented and tested in this project using C language. …”
Get full text
Get full text

A comparative analysis of Prim, Kruskal, and Reverse-Delete algorithms in optimizing routes within Terengganu’s and Pahang’s attraction road network / Munashahira Mohammad Zahid by Mohammad Zahid, Munashahira

“…The Reverse-Delete algorithm works in reverse; it starts with the full graph and iteratively removes the largest edges, ensuring that the graph remains connected. …”
Get full text
Get full text

Predicting future sales using genetic algorithm: data mining sales / Siti Hajar Yaacob by Yaacob, Siti Hajar

Subjects: Get full text
Get full text

A hybrid algorithm for finding shortest path in network routing. by Soltan Aghaei, Mohammad Reza, Ahmad Zulkarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin

“…This wave gives an O( N ) steps quantum algorithm for identifying that record, where was used classical Dijkstra’s algorithm for finding shortest path problem in the graph of network and implement quantum search. …”
Get full text

Guidance system based on Dijkstra-ant colony algorithm with binary search tree for indoor parking system by Mohammad Ata, Karimeh Ibrahim, Che Soh, Azura, Ishak, Asnor Juraiza, Jaafar, Haslina

“…However, the traditional Dijkstra’s is not accurate and need more time to perform the path in order it should visit all the nodes in the graph. In this paper, the Dijkstra-ant colony algorithm (ACO) with binary search tree (BST) has been proposed. …”
Get full text
Get full text
Get full text

Vegetation height estimation near power transmission poles via satellite stereo images using 3D depth estimation algorithms by Qayyum A., Malik A.S., Saad M.N.M., Iqbal M., Abdullah F., Rahseed W., Abdullah T.A.R.B.T., Ramli A.Q.

“…Dynamic programming; Electric lines; Electric utilities; Graph algorithms; Graphic methods; Poles; Power transmission; Remote sensing; Satellites; Stereo image processing; Transmissions; Vegetation; 3D depth approach; Graph cut; QuickBird satellite; Satellite sensors; Stereo matching; Outages…”

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

Subjects: Get full text
Get full text

Synthesis of transistor chaining algorithm for CMOS cell layout using bipartite graph / Azizi Misnan by Misnan, Azizi

Get full text
Get full text

Vegetation height estimation near power transmission poles via satellite stereo images using 3D depth estimation algorithms by Qayyum, Abdul, Malik, Aamir Saeed, Mohamad Saad, Mohamad Naufal, Iqbal, Mahboob, Abdullah, Mohd Faris, Rasheed, Waqas, Tuan Abdullah, Tuan Ab Rashid, Ramli, A Q

“…Our results show that Graph-Cut Algorithm performs better than dynamic programming (DP) in terms of accuracy and speed.…”
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

Spanning Tree Transformation of Connected Graph into Single-Row Network by Loh, Ser Lee, Salleh, Shaharuddin, Sarmin, Nor Haniza

“…Path-Growing Tree-Forming algorithm applied with Vertex-Prioritized is contained in the model to produce the spanning tree from the connected graph. …”
Get full text
Get full text

Network instrusion prevention system ( NIPS) based on network intrusion detection system (NIDS) and ID3 algorithm decision tree classifier by Syurahbil, A

“…Network security has gained significant attention in research and industrial communities.Due to the increasing threat of the network intrusion,firewalls have become important elements of the security policy.Firewall performance highly depends toward number of rules,because the large more rules the consequence makes downhill performance progressively.Firewall can be allow or deny access network packets incoming and outgoing into Local Area Network(LAN),but firewall can not detect intrusion.To distinguishing an intrusion network packet or normal is very difficult and takes a lot of time.An analyst must review all the network traffics previously.In this study,a new way to make the rules that can determine network packet is intrusion or normal automatically.These rules implemented into firewall as prevention,which if there is a network packet that match these rules then network packet will be dropped.This is called Network Intrusion Prevention System(NIPS).These rules are generated based on Network Intrusion Detection System(NIDS)and Iterative Dichotomiser 3 (ID3)Algorithm Decision Tree Classifier,which as data training is intrusion network packet and normal network packets from previous network traffics.The experiment is successful,which can generate the rules then implemented into a firewall and drop the intrusion network packet automatically.Moreover,this way can minimize number of rules in firewall.…”
Get full text
Get full text

On some packing and partition problems in geometric graphs by Trao, Hazim Michman

“…An algorithm for computing such plane perfect matchings is also presented. …”
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

“…Two algorithms (WWM1 and WWM2) are proposed for solving this problem. …”
Get full text
Get full text
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

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

Nano-scale VLSI clock routing module based on useful-skew tree algorithm by Eik Wee, Chew, Heng Sun, Ch'ng, Shaikh-Husin, Nasir, Hani, Mohamed Khalil

“…We implemented Useful-Skew Tree (UST) algorithm which is based on the deferred-merge embedding (DME) paradigm, as the clock layout synthesis engine. …”
Get full text
Get full text

Improving performance of automated coronary arterial tree center-line extraction, stent localization and tracking by Boroujeni, Farsad Zamani

Subjects: Get full text
Get full text

Benchmark simulator with dynamic environment for job scheduling in grid computing by Ku-Mahamud, Ku Ruhana

“…Job scheduling algorithm has a significant influence on grid computing performance. …”
Get full text
Get full text
Get full text