Search Results - parallel computing ((graph algorithm) OR (bat algorithm))*

A hybrid bat–swarm algorithm for optimizing dam and reservoir operation by Yaseen, Zaher Mundher, Allawi, Mohammed Falah, Karami, Hojat, Ehteram, Mohammad, Farzin, Saeed, Ahmed, Ali Najah, Koting, Suhana, Mohd, Nuruol Syuhadaa, Jaafar, Wan Zurina Wan, Afan, Haitham Abdulmohsin, El-Shafie, Ahmed

“…This study proposes a new hybrid optimization algorithm based on a bat algorithm (BA) and particle swarm optimization algorithm (PSOA) called the hybrid bat–swarm algorithm (HB-SA). …”
Get full text
Get full text

A hybrid bat�swarm algorithm for optimizing dam and reservoir operation by Yaseen Z.M., Allawi M.F., Karami H., Ehteram M., Farzin S., Ahmed A.N., Koting S.B., Mohd N.S., Jaafar W.Z.B., Afan H.A., El-Shafie A.

A genetic similarity algorithm for searching the Gene Ontology terms and annotating anonymous protein sequences by M. Othman, Razib, Deris, Safaai, Md. IIlias, Rosli

“…The genetic similarity algorithm combines semantic similarity measure algorithm with parallel genetic algorithm. …”
Get full text
Get full text
Get full text

Generic DNA encoding design scheme to solve combinatorial problems by Rofilde, Hasudungan

“…However, DNA computing can solve the problem in linear time since the parallel processing power of DNA computing is able to generate a solution in a single process. …”
Get full text
Get full text

Random sampling method of large-scale graph data classification by Rashed Mustafa, Mohammad Sultan Mahmud, Mahir Shadid

“…After that, we randomly select a subset of data blocks, each being a random sample of the graph dataset, and compute the different graph property distributions. …”
Get full text
Get full text
Get full text

DNA Computing Technique to Solve Vertex Coloring Problem by Hasudungan, Rofilde, Rohani, Abu Bakar

“…In this paper we proposed DNA based computer to solve vertex coloring problem where in this paper we proposed DNA encoding and computational procedure inspired by greedy algorithm to generate all possible solutions to coloring a graph.…”
Get full text
Get full text
Get full text

High-Speed shortest path co-processor design by Idris, Mohd Yamani Idna, Abu Bakar, Suraya, Tamil, Emran Mohd, Razak, Zaidi, Noor, Noorzaily Mohamed

“…Shortest path algorithms are significant in graph theory and have been applied in many applications such as transportation and networking. …”
Get full text
Get full text

Partitioning techniques and their parallelization for stiff system of ordinary differential equations by Othman, Khairil Iskandar

“…The graphs of its performance and execution time, visualize the advantages of parallelizing.…”
Get full text
Get full text

Unconstraint assignment problem : a molecular computing approach by Zuwairie, Ibrahim, Yusei, Tsuboi, Osamu, Ono, Marzuki, Khalid

“…Since DNA computing is very suitable for combinatorial problems, in thispaper, an idea on DNA-based computing algorithm for solving unconstraint assignment problem is proposed. …”
Get full text
Get full text

Communication in Chordal Ring Networks by Matroud, Atheer Abbas

“…Based on the existing results in [61] done by Narayanan and Opatrny, we propose a new algorithm for some families of chordal ring of degree six graphs. …”
Get full text
Get full text

Simulated kalman filter (SKF) based image template matching for distance measurement by using stereo vision system by Nurnajmin Qasrina Ann, Ayop Azmi

“…By implementing optimization algorithm in image template matching, it is expected that the computation time can be reduced. …”
Get full text
Get full text

P2P-Based Image Recognition for Component Tracking in a Large Engineering Domain by Amir, Amiza, Muhamad Amin , Anang Hudaya, Khan, Asad I.

Get full text
Get full text
Get full text

A test case generation framework based on UML statechart diagram by Salman, Yasir Dawood

Get full text
Get full text
Get full text
Get full text