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

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

“…This project implement a algorithm for the optimal transistor chaining problem in CMOS functional cell layout based on Uehara and vanCleemput's layout style [1] which assumed that the height of each logic module layout is constant and performed the optimisation by decomposing the graph module into a minimum number of sub graph having a dual Euler (d-Euler) trail.. …”
Get full text
Get full text

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

“…Besides that, Genetic Algorithm is applying to predict future sales based on the sales and product data. …”
Get full text
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

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

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

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

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

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

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

“…The experimental results show that combining the advantages of the geometric based validation and contrast based filtering as well as avoiding large quantization errors, lead to significant enhancement in the performance of the seed point detection algorithm in terms of balancing between the precision and recall. …”
Get full text
Get full text

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

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

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

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

“…There are several existing path planning methods such as Visibility Graph (VG), Voronoi Diagram (VD), Potential Fields (PF) and Rapidly-Exploring Random Tree (RRT). …”
Get full text
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

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

An improved algorithm for channel allocation on direct sequence spread spectrum by Handrizal, M

“…Graph coloring is a useful algorithm for channel allocation on Direct Sequence Spread Spectrum (DSSS).Through this algorithm,each access point (AP) that adjacent gives different channels based on colors available.Welsh Powell algorithm and Degree of saturation (Dsatur) are the popular algorithms being used for channel allocation in this domain. …”
Get full text
Get full text

A lightweight graph-based pattern recognition scheme in mobile ad hoc networks. by Raja Mahmood, Raja Azlina, Muhamad Amin, Anang Hudaya, Amir, Amiza, Khan, Asad I.

“…Both algorithms show comparable detection results. Thus, the lightweight, low computation DHGN based detection scheme offers an effective security solution in MANETs.…”
Get full text

Analysis and modeling of database storage optimization power consumption usage for green data centers by Wan Noor Hamiza, Wan Ali

“…The proxies can be discovered by using a developed algorithm of functional dependencies (FDs) called as TANE algorithm. …”
Get full text
Get full text
Get full text
Get full text

An empirical study of pattern leakage impact during data preprocessing on machine learning-based intrusion detection models reliability by Bouke, Mohamed Aly, Abdullah, Azizol

“…Additionally, we find that some algorithms are more sensitive to data leakage than others, as seen by the drop in model accuracy when built without leakage. …”
Get full text
Get full text