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

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

“…Searching for possible abutment between the transistor pairs are modelled as a bipartite graph. A depth - first search algorithm is used to search for optimal chaining. …”
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

“…This solution depending on applying the optimization on an optimal path while the traditional ACO is optimizing the random path based on the greedy algorithm hence we get the most optimal path. …”
Get full text
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

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

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

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

Ant colony optimization based subset feature selection in speech processing: Constructing graphs with degree sequences by Rajesvary Rajoo R., Salam R.A.

Genetic algorithms for VLSI micro-Cell layout area optimization based on binary tree by Hasliza, A. Rahim@Samsuddin, Ab Al-Hadi, Ab Rahman, R. Badlishah, Ahmad, 'Aini Syuhada, Md Zain, M.I., Ahmad, Wan Nur Suryani Firuz, Wan Arrifin

Get full text

African Buffalo Optimization (ABO): A New Metaheuristic Algorithm by Odili, Julius Beneoluchi, M. N. M., Kahar

“…The African Buffalo Optimization (A.B.0) algorithm simulates the African buffalos' behaviour by encapsulation in a mathematical model; which solves a number of discrete optimization problems using graph-based route planning, job scheduling and it extends Swarm Intelligence paradigms. …”
Get full text
Get full text
Get full text

Individual-tree segmentation and extraction based on LiDAR point cloud data by Liu, Xiaofeng, Abdullah, Muhamad Taufik, Mustaffa, Mas Rina, Nasharuddin, Nurul Amelina

“…The objective was to identify the optimal parameters for both algorithms in terms of tree height extraction precision. …”
Get full text
Get full text
Get full text

An algorithm for the selection of planting lining technique towards optimizing land area: an algorithm for planting lining technique selection by Md Badarudin, Ismadi, Md Sultan, Abu Bakar, Sulaiman, Md. Nasir, Mamat, Ali, Tengku Muda Mohamed, Mahmud

“…This algorithm solution generated the dataset based coordinates areas to analyze the techniques. …”
Get full text
Get full text

Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article by Othman, Nor Shuhaida

“…The Smith-Waterman is been simplified into four modules which were initialization, score calculation, matrix filling and optimal path. The scope of the paper based on optimal path trace back using graph theory. …”
Get full text
Get full text

Approximate methods for minimum vertex cover fail to provide optimal results on small graph instances: A review by Fayaz, Muhammad, Arshad, Shakeel, Shah, Abdul Salam, Shah, Asadullah

“…The key contribution of this paper is the provision of small benchmark graphs on which the given approximation algorithms fail to provide optimal results. …”
Get full text
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

“…The problem of finding the minimum spanning tree (MST) is one of the most extensively studied and significant combinatorial optimization problems in graph theory. …”
Get full text
Get full text

Optimized routing algorithm for mobile multicast source in Wireless Mesh Networks by Sanni, Mistura Laide, Hassan Abdalla Hashim, Aisha, Hassan, Wan Haslina, Anwar, Farhat, Ahmed, Gharib Subhi Mahmoud

“…Thus this paper proposes a Differential Evolution based optimized mobile multicast routing algorithm for the shared tree architecture. …”
Get full text
Get full text
Get full text
Get full text

Tree-based contrast subspace mining method by Florence Sia Fui Sze

“…Hence, this thesis presents the optimization of parameters values for the tree-based method by genetic algorithm. …”
Get full text
Get full text
Get full text

Optimizing tree planting areas through integer programming and improved genetic algorithm by Md Badarudin, Ismadi

“…In conclusion, the hybrid algorithm based solution strategies improved efficiency with convincing results, therefore, this will assist planners for better decision making to optimize area to achieve more trees to be planted. …”
Get full text
Get full text

Graph-Based Algorithm With Self-Weighted And Adaptive Neighbours Learning For Multi-View Clustering by He, Yanfang

“…To address this issue, this study incorporated joint graph learning from the gmc algorithm into swmcan, creating a new algorithm called swmcan-jg. …”
Get full text
Get full text

Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator by Othman, Nor Shuhaida

“…The Smith-Waterman is been simplified into four modules which were initialization, score calculation, matrix filling and optimal path. The scope of the paper based on optimal path trace back using graph theory. …”
Get full text
Get full text

Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

“…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
Get full text
Get full text
Get full text