Search Results - (( optimal graph algorithm ) OR ( optimal step algorithm ))

Optimize the maximum flow of electricity capacity using Ford Fulkerson, Edmonds Karp and Goldberg Tarjan algorithm / Nik Nur Diyana Nik Mohd Huzaidi by Nik Mohd Huzaidi, Nik Nur Diyana

“…The process involves transforming data into a residual graph representing electricity flow through substations and power lines, then applying the algorithms step by step to determine maximum flow capacity. …”
Get full text
Get full text

An optimal approximation algorithm for optimization of un-weighted minimum vertex cover problem by Fayaz, Muhammad, Arshad, S, Shah, Abdul Salam, Shah, Asadullah

“…Mean of Neighbors of Minimum Degree Algorithm (MNMA) is proposed in this paper. The MNMA produces optimal or near optimal vertex cover for any known undirected, un-weighted graph. …”
Get full text
Get full text
Get full text

Design and analysis of construction and recombination module using Idury Waterman Algorithm for fragment assembly application / Hafifi Mohd Rafi by Mohd Rafi, Hafifi

“…This algorithm will be implemented on the Xilinx ISE 12.4 software to model the sequence and optimize the last sequence of DNA. …”
Get full text
Get full text

Effects of Different Superpixel Algorithms on Interactive Segmentations by Soo See, Chai, Luong Goh, Kok, Weng Ng, Giap, Muzaffar, Hamzah

“…Though employed as pre-processing step in many interactive segmentation algorithms, to date, no study has been conducted to assess the effects of such incorporations on the segmentation algorithms. …”
Get full text
Get full text
Get full text

Test case minimization applying firefly algorithm by Hashim, Nor Laily, Dawood, Yasir Salman

“…The proposed test case minimization method has the following steps: provide weight to the paths, calculate path coverage for each path, transform an immediate graph into an adjacency matrix, which later is used to apply firefly algorithm and generate optimal test cases. …”
Get full text
Get full text
Get full text

Artificial bee colony algorithm with proposed discrete nearest neighborhood algorithm for discrete optimization problems by Rahimi, Amir Masoud, Ramezani-Khansari, Ehsan

“…In order to improve the final solutions of a single created tour, The employee bees’ movement radius has been limited, because of avoidance of long random jump between nodes. To reduce the optimization time of the tours created by the artificial bee colony algorithm, the fixed-radius near neighbor 2-opt algorithm was used as well. …”
Get full text
Get full text
Get full text

Effects of Different Superpixel Algorithms on Interactive Segmentations by Goh, Kok Luong, Ng, Giap Weng, Muzaffar Hamzah, Chai, Soo See

“…Though employed as pre-processing step in many interactive segmentation algorithms, to date, no study has been conducted to assess the effects of such incorporations on the segmentation algorithms. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Development of deep reinforcement learning based resource allocation techniques in cloud radio access network by Amjad, Iqbal

“…The first proposed algorithm aims to optimize the EE by controlling the on/off status of RRH via a deep Q network (DQN) and subsequently solving a power optimization problem. …”
Get full text
Get full text

Novel Adaptive Bacterial Foraging Algorithms for Global Optimisation with Application to Modelling of a TRS by Ahmad Nor Kasruddin, Nasir, Nor Maniha, Abd Ghani, Tokhi, M. O.

“…The constant step size in the original bacterial foraging algorithm causes oscillation in the convergence graph where bacteria are not able to reach the optimum location with large step size, hence reducing the accuracy of the final solution. …”
Get full text
Get full text

HATS: HetTask scheduling by Koohi, Sina Zangbari, Abdul Hamid, Nor Asilah Wati, Othman, Mohamed, Ibragimov, Gafurjan

“…The proposed algorithm adopts an updated multi-level hyper-graph partitioning approach. …”
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

“…We considered the drawbacks and advantage various algorithms and concluded that Greedy algorithm is comparatively better than other algorithms regarding the optimal solution.…”
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. …”
Get full text
Get full text

Hierarchical Approach in Clustering to Euclidean Traveling Salesman Problem by Fajar, A., Herman, N. S., Abu, N. A., Sahib, S.

“…There has been growing interest in studying combinatorial optimization problems by clustering strategy, with a special emphasis on the traveling salesman problem (TSP). …”
Get full text

Learning analytic framework for students’ academic performance and critical learning pathways by Lyn, Jessica Tan Yen, Goh, Yong Kheng, Lai, An Chow, Ngeow, Yoke Meng

“…These algorithms group students based on academic performance and course profiles, facilitating the identification of clusters with similar characteristics and academic trajectories. …”
Get full text
Get full text
Get full text

Family of singly diagonally implicit block backward differentiation formulas for solving stiff ordinary differential equations by Saufianim, Jana Aksah

“…The scheme is proposed to optimize the total steps taken by the methods to approximate solutions which later displays a better performance in solving the problems. …”
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.

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

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

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

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