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

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

“…The superpixels generated by these five algorithms will be used on two interactive image segmentation algorithms: i) Maximal Similarity based Region Merging (MSRM) and ii) Graph-Based Manifold Ranking (GBMR) with single and multiple strokes on various images from the Berkeley image dataset. …”
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

“…The superpixels generated by these five algorithms will be used on two interactive image segmentation algorithms: i) Maximal Similarity based Region Merging (MSRM) and ii) Graph-Based Manifold Ranking (GBMR) with single and multiple strokes on various images from the Berkeley image dataset. …”
Get full text
Get full text
Get full text
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

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

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

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

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

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

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

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

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

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

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

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

Power system network splitting and load frequency control optimization using ABC based algorithms / Kanendra Naidu a/l Vijyakumar by Vijyakumar, Kanendra Naidu

“…This research presents a modified optimization program for the system splitting problem in large scale power system based on Artificial Bee Colony algorithm and graph theory. …”
Get full text
Get full text

A comparative study of greedy algorithms and dynamic programming in road network / Nuralya Sofea Hairulanuar by Hairulanuar, Nuralya Sofea

“…This study provides an in-depth analysis of four well-known algorithms which are Dijkstra's algorithm, A* algorithm, Floyd Warshall, and Bellman Ford in the context of optimizing road networks. …”
Get full text
Get full text

An online density-based clustering algorithm for data stream based on local optimal radius and cluster pruning by Islam, Md Kamrul

“…This algorithm maintains the local optimal radius of micro-clusters rather than a global and constant radius. …”
Get full text
Get full text

Synthesis of transistor chaining algorithm for CMOS cell layout using euler path / Sukri Hanafiah by Hanafiah, Sukri

“…The euler's path it using pseudo input and Heuristic algorithm to find the minimum interlace. The comparison between euler's path and Bipartite graph Algorithm [14] will be made at the end this of this report to see which one give optimal chaining .…”
Get full text
Get full text