Search Results - (( developing sequence optimization algorithm ) OR ( based optimization path algorithm ))

Refine Results
  1. 1

    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article by Othman, Nor Shuhaida

    Published 2010
    “…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
    Article
  2. 2

    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator by Othman, Nor Shuhaida

    Published 2010
    “…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
    Student Project
  3. 3

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…A three-dimensional model consisting of the drilling process and pocket milling process was developed using Solidworks software. Matlab software was used to develop the algorithm based on Ant Colony, which was then used to optimize the process sequence. …”
    Get full text
    Get full text
    Article
  4. 4

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…A three-dimensional model consisting of the drilling process and pocket milling process was developed using Solidworks software. Matlab software was used to develop the algorithm based on Ant Colony, which was then used to optimize the process sequence. …”
    Get full text
    Get full text
    Article
  5. 5

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…A three-dimensional model consisting of the drilling process and pocket milling process was developed using Solidworks software. Matlab software was used to develop the algorithm based on Ant Colony, which was then used to optimize the process sequence. …”
    Get full text
    Get full text
    Article
  6. 6

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…A three-dimensional model consisting of the drilling process and pocket milling process was developed using Solidworks software. Matlab software was used to develop the algorithm based on Ant Colony, which was then used to optimize the process sequence. …”
    Get full text
    Get full text
    Article
  7. 7

    Minimization of machining process sequence based on ant colony algorithm and conventional method by Abdullah, Haslina, Law, Boon Hui C., Zakaria, Mohamad Shukri

    Published 2023
    “…A three-dimensional model consisting of the drilling process and pocket milling process was developed using Solidworks software. Matlab software was used to develop the algorithm based on Ant Colony, which was then used to optimize the process sequence. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by H. ABDULLAH, H. ABDULLAH, C. LAW BOON HUI, C. LAW BOON HUI, M. S. ZAKARIA, M. S. ZAKARIA

    Published 2023
    “…A three-dimensional model consisting of the drilling process and pocket milling process was developed using Solidworks software. Matlab software was used to develop the algorithm based on Ant Colony, which was then used to optimize the process sequence. …”
    Get full text
    Get full text
    Article
  9. 9

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by H. ABDULLAH, H. ABDULLAH, C. LAW BOON HUI, C. LAW BOON HUI, M. S. ZAKARIA, M. S. ZAKARIA

    Published 2023
    “…A three-dimensional model consisting of the drilling process and pocket milling process was developed using Solidworks software. Matlab software was used to develop the algorithm based on Ant Colony, which was then used to optimize the process sequence. …”
    Get full text
    Get full text
    Article
  10. 10

    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD by ABDULLAH, H., LAW BOON HUI, C., ZAKARIA, M. S.

    Published 2023
    “…A three-dimensional model consisting of the drilling process and pocket milling process was developed using Solidworks software. Matlab software was used to develop the algorithm based on Ant Colony, which was then used to optimize the process sequence. …”
    Get full text
    Get full text
    Article
  11. 11

    Hybrid optimal path traceback system development for optimization DNA sequences alignment by Ahmad Sabri, Nur Dalilah

    Published 2012
    “…This paper present the new hybrid optimal path trace back system development for solving optimal path trace back complexity issue. …”
    Get full text
    Get full text
    Student Project
  12. 12

    Hybrid optimal path traceback system development for optimizing DNA sequences alignment: article by Ahmad Sabri, Nur Dalilah

    Published 2012
    “…This paper present the new hybrid optimal path trace back system development for solving optimal path trace back complexity issue. …”
    Get full text
    Get full text
    Article
  13. 13

    Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms by Koh, Johnny Siaw Paw

    Published 2008
    “…Also, this research involves in developing a machine-learning system and program via genetic algorithm that is capable of performing independent learning capability and optimization for scanning sequence using novel GA operators. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Algorithms based on spider daddy long legs for finding the optimal route in securing mobile ad hoc networks by Ghathwan, Khalil Ibrahim

    Published 2016
    “…The new method is called the Daddy Long-Legs Algorithm (PGO-DLLA), which modifies the standard AODV and optimizes the routing process. …”
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15

    Hybrid multiobjective genetic algorithm for integrated dynamic scheduling and routing of jobs and automated guided vehicles in flexible manufacturing systems by Umar, Umar Ali

    Published 2014
    “…The algorithm generates an integrated scheduling and detail paths route while optimizing makespan, AGV travel time, mean flow time and penalty cost due to jobs tardiness and delay as a result of conflict avoidance. …”
    Get full text
    Get full text
    Thesis
  16. 16

    Ant system with heuristics for capacitated vehicle routing problem by Tan, Wen Fang

    Published 2013
    “…The aim of this research is to develop an Ant Colony Optimization (ACO) for solving the CVRP where it simulates the behavior of real ants that always find the shortest path between their nest and a food source through an indirect form of communication, namely pheromone trail. …”
    Get full text
    Get full text
    Thesis
  17. 17

    Routing problem in rectangular mesh network using shortest path based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2019
    “…In order to achieve this objective, each net need to be routed as shortest as possible. Therefore, developing a shortest path based routing algorithm is in need. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18

    Routing problem in rectangular mesh network using shortest path based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2019
    “…In order to achieve this objective, each net need to be routed as shortest as possible. Therefore, developing a shortest path based routing algorithm is in need. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  19. 19

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

    Published 2017
    “…The key innovation is to implement DNA sequence assembly algorithms on ASIC to make it a synthesisable IP block. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Routing problem in rectangular mesh network using Dijkstra’s based Greedy method by Noraziah, Adzhar, Shaharuddin, Salleh, Yuhani, Yusof, Muhammad Azrin, Ahmad

    Published 2018
    “…In order to achieve this objective, each net need to be routed as shortest as possible. Therefore, developing a shortest path based routing algorithm is in need. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item