Search Results - (( set generation graph algorithm ) OR ( java application using algorithm ))

Butterfly Triple System Algorithm Based on Graph Theory by Ibrahim, Haslinda, Aldiabat, Raja’i, Karim, Sharmila

“…In combinatorial design theory, clustering elements into a set of three elements is the heart of classifying data, which has recently received considerable attention in the fields of network algorithms, cryptography, design and analysis of algorithms, statistics, and Information theory. …”
Get full text
Get full text
Get full text

Implementation of Graph Based Path Planning Algorithms on a Mobile Robot in a Confined Site by TANG, HON PANN

“…This project investigates the performance of three different graph based path planning algorithms used, relaxed A*, A* and Dijkstra’s algorithm in a few environments with different obstacles settings using Gazebo environment simulator and Turtlebot simulator (computer simulation) and 4WD navigation robot (real environment simulation).…”
Get full text
Get full text

Representation of half wing of butterfly and hamiltonian circuit for complete graph using starter set method by Karim, Sharmila, Ibrahim, Haslinda, Mohd Darus, Maizon

“…We provide an example for case n = 4 and 5 to exemplify the algorithms. Furthermore, the calculation for order of complexity is also presented for generating distinct half wing and hamiltonian circuit using starter set method.…”
Get full text
Get full text
Get full text

A hybrid local search algorithm for minimum dominating set problems by Abed, S.A., Rais, H.M., Watada, J., Sabar, N.R.

“…This algorithm focuses on generating promising solutions in different areas of the solution space using the problem search history. …”
Get full text
Get full text

A hybrid local search algorithm for minimum dominating set problems by Abed, S.A., Rais, H.M., Watada, J., Sabar, N.R.

“…This algorithm focuses on generating promising solutions in different areas of the solution space using the problem search history. …”
Get full text
Get full text

Performance analysis of bacterial genome assemblers using illumina next generation sequencing data / Nur ‘ Ain Mohd Ishak by Nur ‘ Ain , Mohd Ishak

“…In this study, the performance of four de novo assemblers (SPAdes, ABySS, Velvet and MaSuRCA) is reported, in which variants of de Brujin graph algorithms are applied, using genomic data generated by the Illumina sequencing platform. …”
Get full text
Get full text
Get full text

A new technique for improving the dispersion of a set of samples. Application in multi-query motion planning by Khaksar W., Hong T.S., Sahari K.S.B.M., Khaksar M.

“…In this paper, we proposed a new learning strategy for probabilistic roadmap (PRM) algorithm. The proposed strategy is based on reducing the dispersion of the generated set of samples. …”

A low dispersion probabilistic roadmaps (LD-PRM) algorithm for fast and efficient sampling-based motion planning by Khaksar, Weria, Tang, Sai Hong, Khaksar, Mansoor, Motlagh, Omid Reza Esmaeili

“…In this paper, we propose a new learning strategy for a probabilistic roadmap (PRM) algorithm. The proposed strategy is based on reducing the dispersion of the generated set of samples. …”
Get full text
Get full text
Get full text

RSA Encryption & Decryption using JAVA by Ramli, Marliyana

“…References and theories to support the research of 'RSA Encryption/Decryption using Java' have been disclosed in Literature Review section. …”
Get full text
Get full text

Plagiarism Detection System for Java Programming Assignments by Using Greedy String-Tilling Algorithm by Norulazmi, Kasim

Get full text
Get full text
Get full text

Provider independent cryptographic tools by Ibrahim, Subariah, Salleh, Mazleena, Abdul Aziz, Shah Rizan

Get full text
Get full text
Get full text

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

“…It involves finding groupings, ordering, or assignment of a discrete; finite set of objects that satisfy given conditions. The complexity of combinatorial problems is classified as NP meaning that algorithms are yet to exist to efficiently solve the problem. …”
Get full text
Get full text

A low dispersion probabilistic roadmaps (LD-PRM) algorithm for fast and efficient sampling-based motion planning by Khaksar W., Hong T.S., Khaksar M., Motlagh O.

“…In this paper, we propose a new learning strategy for a probabilistic roadmap (PRM) algorithm. The proposed strategy is based on reducing the dispersion of the generated set of samples. …”

Laser simulator: a novel search graph-based path planning approach by Ali, Mohammed A. H., Musa, Mailah

“…In addition, a comparative study on the laser simulator approach, A* algorithm, Voronoi diagram with fast marching and PointBug algorithms was performed to show the benefits and drawbacks of the proposed approach. …”
Get full text
Get full text
Get full text

Tracing active power between generators and loads for transmission open access by Zanariah Zainol

Get full text

Design and statistical analysis of initial solution construction approach in curriculum based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

“…This process is a crucial task because it can affect the convergence speed and also the quality of the final solution (Rahnamayan, Tizhoosh, & Salama, 2007).This study able to produce a set of initial solution, therefore it is able to contribute to the improvement phase of approach that uses population of initial solutions such as ant colony optimization (ACO) (Socha, Joshua, & Michael, 2002), genetic algorithm (GA) (Lewis & Paechter, 2005), and harmony search algorithm (HSA) (Al-Betar & Khader, 2010).The approach in this study also shows that a feasible timetable can be found for numerous data set problems.…”
Get full text
Get full text

Bipartite graph approach to course timetabling problems / Hafizah A Razak by A Razak, Hafizah

“…The prototype is design using constructive heuristic algorithm and colouring the edge of two bipartite graphs. …”
Get full text
Get full text

Next generation sequencing-data analysis for cellulose- and xylan-degrading enzymes from POME metagenome by Benbelgacem, Farah Fadwa, Mohd Noor Mat Isa, Abdelrahim, Muhammad Alfatih Muddathir, Afidalina Tumian, Bellag, Oualid Abdelkader, Adibah Parman, Ibrahim Ali Noorbatcha, Hamzah Mohd Salleh

“…Then, raw data filtering was carried out by trimming low quality values and short reads and the vector sequences were removed and again the output was checked and the trimming was repeated until a high quality read sets was obtained. The second step was the de novo assembly of sequences to reconstruct 2900 contigs following de Bruijn graph algorithm. …”
Get full text
Get full text
Get full text

Using modification of Prim's algorithm and GNU Octave and to solve the multiperiods installation problem by ,, Wamiliana, Usman, Mustofa, ,, Warsono, Daoud, Jamal Ibrahim

“…The Minimum Spanning Tree (MST) is one of the famous problems that is used mostly as the backbone in many network design problems. Given a graph G(V,E), where V is the set of vertices and E is the set of edges connecting vertices in V, and for every edge eij there is an associated weight cij ≥0. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Real-Time Video Processing Using Native Programming on Android Platform by Saipullah, Khairul Muzzammil

“…However for the Android platform that based on the JAVA language, most of the software algorithm is running on JAVA that consumes more time to be compiled. …”
Get full text
Get full text
Get full text