Search Results - (( sequence optimization means algorithm ) OR ( sequence optimization search algorithm ))

Refine Results
  1. 1

    Application of intelligence based genetic algorithm for job sequencing problem on parallel mixed-model assembly line by Noroziroshan, Alireza, Mohd Ariffin, Mohd Khairol Anuar, Ismail, Napsiah

    Published 2010
    “…By this means, intelligence based genetic algorithm only concentrated on those initial populations that produce better solutions instead of probing the entire search space. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    Genetic algortihm to solve pcb component placement modeled as travelling salesman problem by Mohd Khazzarul Khazreen, Mohd Zaidi

    Published 2013
    “…Genetic algorithms are a class of stochastic search algorithms based on biological evolution. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  3. 3

    A genetic algorithm to minimise the maximum lateness on a single machine family scheduling problem by Lee, Lai Soon, Nazif, Habibeh

    Published 2009
    “…The OCGA is compared with other well known local search method namely dynamic length tabu search, randomised steepest descent method, and other variants of genetic algorithms using extensive data sets collected from the literatures. …”
    Get full text
    Conference or Workshop Item
  4. 4

    Neural network-based codebook search for image compression by Bodruzzaman, M., Gupta, R., Karim, M.R., Bodruzzaman, S.

    Published 2000
    “…This subset is then used as a candidate set and an exhaustive search is then performed within this subset to find an optimal code sequence which minimizes the perceptual error between coded and decoded images. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  5. 5

    Safe experimentation dynamics algorithm for data-driven PID controller of a class of underactuated systems by Nor Sakinah, Abdul Shukor

    Published 2019
    “…Previously, SED algorithm has been applied in to control scheme of wind farm to optimize the total power production but has yet to be applied in PID tuning. …”
    Get full text
    Get full text
    Thesis
  6. 6

    Safe experimentation dynamics algorithm for data-driven PID controller of a class of underactuated systems by Nor Sakinah, Abdul Shukor

    Published 2019
    “…Previously, SED algorithm has been applied in to control scheme of wind farm to optimize the total power production but has yet to be applied in PID tuning. …”
    Get full text
    Get full text
    Thesis
  7. 7
  8. 8

    Gravitational Search Algorithm for Assembly Sequence Planning by Ismail, Ibrahim, Zuwairie, Ibrahim, Hamzah, Ahmad, Mohd Falfazli, Mat Jusof, Zulkifli, Md. Yusof, Sophan Wahyudi, Nawawi, Marizan, Mubin

    Published 2014
    “…In this paper, an approach using Gravitational Search Algorithm (GSA) which is a heuristic optimization algorithm that incorporates the Newton’s law of gravity and the law of motion into analytical studies of systems is proposed to solve the assembly sequence planning problem. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  9. 9

    Product assembly sequence optimization based on genetic algorithm by Yasin, Azman, Puteh, Nurnasran, Daud, Ruslizam, Omar, Mazni, Syed-Abdullah, Sharifah Lailee

    Published 2010
    “…Genetic algorithm (GA) is a search technique used in computing to find approximate solution to optimization and search problem based on the theory of natural selection. …”
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    An assembly sequence planning approach with a rule-based multi-state gravitational search algorithm by Ibrahim, I., Ibrahim, Z., Ahmad, Hamzah, Jusof, M.F.M., Yusof, Z.M., Nawawi, S.W., Mubin, M.

    Published 2015
    “…In this paper, an approach based on a new variant of the gravitational search algorithm (GSA) called the rule-based multi-state gravitational search algorithm (RBMSGSA) is used to solve the assembly sequence planning problem. …”
    Get full text
    Get full text
    Get full text
    Article
  11. 11

    An Assembly Sequence Planning Approach with a Rule-based Multi-state Gravitational Search Algorithm by Ismail, Ibrahim, Zuwairie, Ibrahim, Hamzah, Ahmad, Mohd Falfazli, Mat Jusof, Zulkifli, Md. Yusof, Sophan Wahyudi, Nawawi, Marizan, Mubin

    Published 2015
    “…In this paper, an approach based on a new variant of the gravitational search algorithm (GSA) called the rule-based multi-state gravitational search algorithm (RBMSGSA) is used to solve the assembly sequence planning problem. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12

    A guided dynamic programming approach for DNA sequence similarity search by Mohd Nordin Abdul Rahman

    Published 2011
    “…DNA sequence similarity search is an important task in computational biology applications. …”
    Get full text
    Thesis
  13. 13

    A filtering algorithm for efficient retrieving of DNA sequence by Abdul Rahman, Mohd Nordin, Mohd. Saman, Md. Yazid, Ahmad, Aziz, Md. Tap, Abu Osman

    Published 2009
    “…The algorithm filtered the expected irrelevant DNA sequences in database from being computed for dynamic programming based optimal alignment process. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Sequence and sequence-less t-way test suite generation strategy based on the elitist flower pollination algorithm by Mohammed Abdullah, Abdullah Nasser

    Published 2018
    “…In line with the emerging field called Search based Software Engineering, many recently developed t-way strategies have adopted meta-heuristic algorithms as the basis of their implementations such as Simulated Annealing, Genetic Algorithm, Ant Colony Optimization Algorithm, Particle Swarm Optimization, Harmony Search and Cuckoo Search, owing their superior performance in term of test size reduction as compared to general computational based strategies, such as General t-way, Test Vector Generator, In Parameter Order General, Jenny, and Automatic Efficient Test Generator. …”
    Get full text
    Get full text
    Thesis
  15. 15

    A Hybrid Ant-Wolf Algorithm to Optimize Assembly Sequence Planning Problem by M. F. F., Ab Rashid

    Published 2017
    “…Purpose – This paper aims to optimize the assembly sequence planning (ASP) problem using a proposed hybrid algorithm based on Ant Colony Optimization (ACO) and Gray Wolf Optimizer (GWO). …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

    Block based motion vector estimation using fuhs16 uhds16 and uhds8 algorithms for video sequence by S. S. S. , Ranjit

    Published 2011
    “…Full search (FS), three step search (TSS), new three step search (NTSS), diamond search (DS) and hexagon based search (HS) are the most well known block-matching algorithm. …”
    Get full text
    Get full text
    Get full text
    Book Chapter
  17. 17

    Design of DNA sequence alignment accelerated system using 2-dimensional array and custom instruction on FPGA / Nur Dalilah Ahmad Sabri by Ahmad Sabri, Nur Dalilah

    Published 2018
    “…Nowadays, the (deoxyribonucleic acid) DNA sequence database has been increased linearly with the time taken to comparing with the search of DNA sequence alignment system. …”
    Get full text
    Get full text
    Thesis
  18. 18
  19. 19

    A discrete simulated kalman filter optimizer for combinatorial optimization problems by Suhazri Amrin, Rahmad

    Published 2022
    “…Another type of algorithm is called numerical algorithms. These algorithms were built specifically to address numerical optimization problems. …”
    Get full text
    Get full text
    Thesis
  20. 20

    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
    “…To evaluate the proposed algorithm, the solutions to the TSP problem obtained from the proposed algorithm and swap sequence based PSO are compared in terms of the best solution, mean solution, and time taken to converge to the optimal solution. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article