Search Results - (( using computational graph algorithm ) OR ( based optimization method algorithm ))

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

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

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

Enhancing three variants of harmony search algorithm for continuous optimization problems by Alomoush, Alaa A., Alsewari, Abdulrahman A., Kamal Z., Zamli, Alrosan, Ayat, Alomoush, Waleed, Alissa, Khalid

“…Meta-heuristic algorithms are well-known optimization methods, for solving real-world optimization problems. …”
Get full text
Get full text
Get full text

Delay and energy-aware routing for efficient data collection in wireless sensor networks / Ihsan Ali by Ihsan , Ali

“…The AFW algorithm reduces unnecessary computations by focusing only on useful edge entries in the graph, thereby expediting the optimization process. …”
Get full text
Get full text
Get full text

The development of parameter estimation method for Chinese hamster ovary model using black widow optimization algorithm by Nurul Aimi Munirah, ., Muhammad Akmal, Remli, Noorlin, Mohd Ali, Hui, Wen Nies, Mohd Saberi, Mohamad, Khairul Nizar Syazwan, Wan Salihin Wong

“…The proposed algorithm has been compared with the other three famous algorithms, which are Particle Swarm Optimization (PSO), Differential Evolutionary (DE), and Bees Optimization Algorithm (BOA). …”
Get full text
Get full text
Get full text

An Improved-Time Polynomial-Space Exact Algorithm For TSP In Degree-5 Graphs by Md Yunos, Norhazwani, Shurbevski, Aleksandar, Nagamochi, Hiroshi

“…While the base of the exponent in the running time bound of our algorithm is greater than 2, it still outperforms Gurevich and Shelah’s O∗(4nnlog n) polynomial-space exact algorithm for the TSP in general graphs (SIAM Journal of Computation, Vol.16, No.3, pp.486–502, 1987). …”
Get full text
Get full text
Get full text
Get full text

MOSDA: A proposal for multiple objective spiral dynamics algorithm by A. R.A., Azwan, Ahmad Nor Kasruddin, Nasir, Sha'akmal, S., A.R.M., Sawal

“…It has a good elitism strategy and has a simple structure. A method called “archive method” that is used in multi-objective particle swarm optimization (MOPSO) is adopted into SDA to develop its multiobjective (MO) type algorithm. …”
Get full text
Get full text
Get full text

PAPR Reduction Using Genetic Algorithm (GA) In OFDM System by Mohd Ramdan, Fatin Najwa Nursyadza

“…In this thesis, a Genetic algorithm (GA) technique is proposed. GA is a type of optimization algorithm, which is natural-based selection and is used to find the optimal solution to the computational problem that maximizes or minimizes a particular function. …”
Get full text
Get full text

Regression test case selection & prioritization using dependence graph and genetic algorithm by Musa, Samaila, Md Sultan, Abu Bakar, Abd Ghani, Abdul Azim, Baharom, Salmi

“…The approach is based on optimization of selected test case from dependency analysis of the source codes. …”
Get full text
Get full text

The conceptual framework of knowledge of large scale and incomplete graphs of skyline queries optimization using machine learning by Noor, Ubair, Hassan, Raini, Dwi Handayani, Dini Oktarina

“…The implemented algorithm to perform such operation was far more efficient, faster and accurate as compared to conventional methods. …”
Get full text
Get full text
Get full text
Get full text

Quality of service in mobile IP networks with parametric multi-channel routing algorithms based on linear programming approach by Gholizadeh, Somayyeh

“…This approach tunes the parameters of the linear programming models that are used in the other algorithms by using a dynamic element. …”
Get full text
Get full text

Design of DNA fragment assembly using IWP method on application-specific integrated-circuit / Hasniliati Hassan by Hassan, Hasniliati

“…After reviewing various algorithms, it was decided to apply de Bruijn graphs and Eulerian circuits that are based on graph theory. …”
Get full text
Get full text

High Rise Building Evacuation Route Model Using DIJKSTRA'S Algorithm by Mohd Sabri, Nor Amalina

“…The information then is used to generate a directed graph in order to obtain the shortest path results through the implementation of shortest path algorithm. The main algorithms involve is Dijkstra’s algorithm and then an Ant Colony Optimization algorithm is used as hybrid versions of Dijkstra’s algorithm. …”
Get full text
Get full text
Get full text
Get full text

A maximal-clique-based clustering approach for multi-observer multi-view data by using k-nearest neighbor with S-pseudo-ultrametric induced by a fuzzy similarity by Khameneh, Azadeh Zahedi, Ghaznavi, Mehrdad, Kilicman, Adem, Mahad, Zahari, Mardani, Abbas

“…The clustering results are analyzed based on several indexes. This analysis shows the efficiency of the proposed algorithm compared to the traditional clustering methods. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.…”
Get full text
Get full text

DNA sequence design for direct-proportional length-based DNA computing: Particle swarm optimization vs population based ant colony optimization by Zulkifli, Md. Yusof, Muhammad Arif, Abdul Rahim, Sophan Wahyudi, Nawawi, Kamal, Khalil, Zuwairie, Ibrahim

“…Generally, in DNA computing, the DNA sequences used for the computation should be critically designed in order to reduce error that could occur during computation. …”
Get full text
Get full text
Get full text

Defects identification on semiconductor wafer for yield improvement using machine learning / Pedram Tabatabaeemoshiri by Pedram , Tabatabaeemoshiri

“…This study addresses the urgent issue of detecting hidden defects in semiconductor wafers that conventional methods overlook. This work presents a novel graph-based semi-supervised learning (GSSL) algorithm designed for wafer defect detection. …”
Get full text
Get full text
Get full text

GNN-based skyline query processing for large-scale and incomplete graphs by Adzman, Hasan Khair, Hassan, Raini, Dwi Handayani, Dini Oktarina

“…However, traditional skyline algorithms struggle with large volumes and missing data, leading to high computational costs and inefficiencies. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Computational methods for self-assembly of DNA nanostructures / Ong Hui San by Ong, Hui San

“…The feasibility of adapting these substrates into conventional silicon machines has been actively studied leading to the emergence of a new computational paradigm, known as molecular computing. …”
Get full text
Get full text

Accelerating graph algorithms with priority queue processor by Heng Sun, Ch'ng, Eik Wee, Chew, Shaikh-Husin, Nasir, Hani, Mohamed Khalil

“…DijkstraÂ’s algorithm is chosen as the target implementation, as many state-of-the-art graph algorithms use DijkstraÂ’s algorithm at the heart of their computational engine. …”
Get full text
Get full text