Search Results - (( sequence optimization path algorithm ) OR ( using application based algorithm ))

Search alternatives:

Refine Results
  1. 1
    An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP

    An enhanced swap sequence-based particle swarm optimization algorithm to solve TSP by Bibi Aamirah Shafaa Emambocus, Muhammed Basheer Jasser, Muzaffar Hamzah, Aida Mustapha, Angela Amphawan

    Published 2021
    “…The proposed algorithm is found to provide better solutions with shorter paths when applied to TSP as compared to swap sequence based PSO. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    Optimizing optimal path trace back system for Smith-Waterman algorithm using structural modelling technique: article

    Optimizing optimal path trace back system for Smith-Waterman algorithm using structural modelling technique: article by Saliman, Nur Farah Ain

    Published 2012
    “…back system for Smith-Waterman Algorithm using Structural Modelling Technique. The objectives for this paper are to optimize the best trace back scanning performance and also to design the simple architecture in order to reduce the runtime. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    Path optimization using genetic algorithm in laser scanning system

    Path optimization using genetic algorithm in laser scanning system by Chen C.P., Koh S.P., Aris I.B., Albert F.Y.C., Tiong S.K.

    Published 2023
    Subjects:
    Conference paper
    Save to List
    Saved in:
  4. 4
    A Novel Integrating Between Tool Path Optimization Using An ACO Algorithm And Interpreter For Open Architecture CNC System

    A Novel Integrating Between Tool Path Optimization Using An ACO Algorithm And Interpreter For Open Architecture CNC System by Yusof, Yusri, Latif, Kamran, Hatem, Noor, A. Kadir, Aini Zuhra, Mohammed, M.A

    Published 2021
    “…Furthermore, high-performing Ant Colony Optimization (ACO) algorithms were used to optimize the travel path time. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  5. 5
    An application of Floyd-Warshall Algortihm in finding shortest path of order picker in warehouse / Saidatul Aisyah Roslan, Siti Norhakimah Mohd Yatim and Siti Sarah Sulaiman

    An application of Floyd-Warshall Algortihm in finding shortest path of order picker in warehouse / Saidatul Aisyah Roslan, Siti Norhakimah Mohd Yatim and Siti Sarah Sulaiman by Roslan, Saidatul Aisyah, Mohd Yatim, Siti Norhakimah, Sulaiman, Siti Sarah

    Published 2019
    “…For the result, shortest path for the order pickers in iterations. The algorithm used can help the order picker to have the shortest path, but it have no direct path. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  6. 6
    Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms

    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
    Save to List
    Saved in:
  7. 7
    Hybrid optimal path traceback system development for optimization DNA sequences alignment

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

    Published 2012
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  8. 8
    Hybrid optimal path traceback system development for optimizing DNA sequences alignment: article

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

    Published 2012
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    Time series data intelligent clustering algorithm for landslide displacement prediction

    Time series data intelligent clustering algorithm for landslide displacement prediction by Han, Liu, Shang, Tao, Shu, Jisen, Khan Chowdhury, Ahmed Jalal

    Published 2018
    “…Dynamic time warping calculation is based on the correlation of time series sequence and the components. The local optimal solution is obtained by recursive search, and the whole curve path is obtained. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Design of DNA fragment assembly using IWP method on application-specific integrated-circuit / Hasniliati Hassan

    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
    Save to List
    Saved in:
  11. 11
    Application of the Bees Algorithm to find optimal drill path sequence

    Application of the Bees Algorithm to find optimal drill path sequence by Zainal Abidin, Muhammad Harith, Kamaruddin, Shafie, Adam Malek, Afiqah, Sukindar, Nor Aiman

    Published 2024
    “…These results show that the Bees Algorithm can be an alternative approach to find the optimal drilling sequence.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  12. 12
    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article

    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
    Save to List
    Saved in:
  13. 13
    Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems / Ong Chung Sin

    Hybrid genetic algorithm with multi-parents recombination for job shop scheduling problems / Ong Chung Sin by Ong, Chung Sin

    Published 2013
    “…This mechanism is restricted to search the possible solutions in a critical path. Modification on the path by using neighborhood search significantly reduces the total length of the makespan. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator

    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
    Save to List
    Saved in:
  15. 15
    Simulated Kalman Filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem

    Simulated Kalman Filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem by Suhazri Amrin, Rahmad, Zuwairie, Ibrahim, Zulkifli, Md. Yusof

    Published 2022
    “…Lastly, a single-agent variant of SKF and a multi-objective SKF were introduced. SKF algorithms and its variants have been implemented in at least nine areas of applications: drill path optimization, airport gate allocation problem (AGAP), assembly sequence planning (ASP), system identification, feature selection, image template matching, controller tuning, wireless sensor network, and engineering design problem. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  16. 16
    Optimization of drilling path using the bees algorithm

    Optimization of drilling path using the bees algorithm by Kamaruddin, Shafie, Rosdi, Mohamad Naqiuddin, Sukindar, Nor Aiman

    Published 2021
    “…This study uses the Bees Algorithm to find the best sequence of drilling holes (minimum total path length) and the results found are compared with the result of other algorithms. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Path optimization using genetic algorithm in laser scanning system

    Path optimization using genetic algorithm in laser scanning system by Chen, Chai Phing, Koh, Johnny Siaw Paw, Aris, Ishak, Fong, Albert Yu Chooi, Tiong, Sieh Kiong

    Published 2008
    “…In this paper, the genetic algorithm (GA) has been proposed to optimize the scanning sequence, thus shortening the required laser scanning path. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  18. 18
    Comparison of DSR, AODV and DSDV routing protocols in mobile ad-hoc networks: A survey

    Comparison of DSR, AODV and DSDV routing protocols in mobile ad-hoc networks: A survey by Abdala, Tarek Mosbah, Dasalla, Valeriano A., Daud, Nasarudin

    Published 2014
    “…A mobile ad hoc network (MANET) is a collection of mobile nodes that is connected through a wireless medium forming rapidly changing topologies.Mantes are infrastructure less and can be set up anytime, anywhere.We have conducted survey of protocol properties of various MANET routing algorithms and analyzed them.The routing algorithms considered are classified into three categories proactive (table driven) , reactive (on demand) and Hybrid protocol.The algorithms considered are Dynamic Source Routing (DSR), Ad-hoc On-Demand Distance Vector Routing (AODV) and Destination sequence Vector (DSDV) have been proposed to solve the multi hop routing problem in Ad-hoc networks.The comparison among three routing protocols are based on the various protocol property parameters such as Routing overhead, packet delivery ratio, end-to-end delay, path optimality, and throughput are some metrics commonly used in the comparisons.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  19. 19
    Examining the round trip time and packet length effect on window size by using the Cuckoo search algorithm

    Examining the round trip time and packet length effect on window size by using the Cuckoo search algorithm by Abubakar, Adamu, Chiroma, Haruna, Khan, Abdullah, Mohamed, Elbaraa Eldaw Elnour

    Published 2016
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD

    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
    “…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
    Save to List
    Saved in:

Search Tools: