Search Results - (( sequence optimization new algorithm ) OR ( sequence optimization based algorithm ))*

Search alternatives:

Refine Results
  1. 1
    Comparative Analysis of Low Discrepancy Sequence-Based Initialization Approaches Using Population-Based Algorithms for Solving the Global Optimization Problems

    Comparative Analysis of Low Discrepancy Sequence-Based Initialization Approaches Using Population-Based Algorithms for Solving the Global Optimization Problems by Waqas Haider Bangyal, Kashif Nisar, Ag. Asri Bin Ag. Ibrahim, Muhammad Reazul Haque, Joel J. P. C. Rodrigues, Danda B. Rawat

    Published 2021
    “…Metaheuristic algorithms have been widely used to solve diverse kinds of optimization problems. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    Sequence t-way test generation using the barnacles mating optimizer algorithm

    Sequence t-way test generation using the barnacles mating optimizer algorithm by Kamal Z., Zamli, Kader, Md. Abdul

    Published 2021
    “…More precisely, we focus on the generation of test cases due to the ordering of inputs (or sequence) using the newly developed Barnacles Mating Optimizer (BMO) Algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  3. 3
    Sequence and sequence-less t-way test suite generation strategy based on the elitist flower pollination algorithm

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

    Published 2018
    “…If t-way strategies are to be adopted in such a system, there is also a need to support test data generation based on sequence of interactions. Addressing these aforementioned issues and complementing the existing sequence based strategies such as t-SEQ, Sequence Covering Array Generator and Bee Algorithm, this thesis presents a unified strategy based on the new meta-heuristic algorithm, called the Elitist Flower Pollination Algorithm (eFPA). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    An Assembly Sequence Planning Approach with a Multi-State Particle Swarm Optimization

    An Assembly Sequence Planning Approach with a Multi-State Particle Swarm Optimization by Ismail, Ibrahim, Zuwairie, Ibrahim, Hamzah, Ahmad, Zulkifli, Md. Yusof

    Published 2016
    “…In this paper, an approach based on a new variant of Particle Swarm Optimization Algorithm (PSO) called the multi-state of Particle Swarm Optimization (MSPSO) is used to solve the assembly sequence planning problem. …”
    Get full text
    Get full text
    Get full text
    Book Chapter
    Save to List
    Saved in:
  5. 5
    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
    “…This paper presents the improvement of Smith-Waterman algorithm in comparing between two DNA sequence alignments. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Studying the Impact of Initialization for Population-Based Algorithms with Low-Discrepancy Sequences

    Studying the Impact of Initialization for Population-Based Algorithms with Low-Discrepancy Sequences by Adnan Ashraf, Sobia Pervaiz, Waqas Haider Bangyal, Kashif Nisar, Ag. Asri Ag. Ibrahim, Joel J. P. C. Rodrigues, Danda B. Rawat

    Published 2021
    “…To solve different kinds of optimization challenges, meta-heuristic algorithms have been extensively used. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    Design and development of high performance swa cell design for local DNA sequence alignment

    Design and development of high performance swa cell design for local DNA sequence alignment by Syed Abdul Rahman, Syed Abdul Mutalib Al Junid

    Published 2017
    “…This study proposed three new DNA sequence alignment accelerator system cell design and architecture based on the Smith-Waterman Algorithm (SWA) named as the new Optimized SWA Linear Gap Penalty (OSL), Optimized SWA Affine Gap Penalty (OSA), and Optimized Recursive Variable Expansion SWA Linear Gap Penalty (ORSL). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  8. 8
    Development of an augmented reality based facility layout planning and optimization / Tan Chee Hau

    Development of an augmented reality based facility layout planning and optimization / Tan Chee Hau by Tan , Chee Hau

    Published 2020
    “…Production line commonly used algorithm such as shortest processing time (SPT), longest processing time (LPT), cycle time optimization and centre of gravity (CoG) algorithm are coded in this system which enables the production schedule and sequence to be optimized. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    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
    “…This paper presents the improvement of Smith-Waterman algorithm in comparing between two DNA sequence alignments. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  10. 10
    An assembly sequence planning approach with a rule-based multi-state gravitational search algorithm

    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
    Save to List
    Saved in:
  11. 11
    An Assembly Sequence Planning Approach with a Rule-based Multi-state Gravitational Search Algorithm

    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
    Save to List
    Saved in:
  12. 12
    Optimization of Assembly Sequence Planning Using Soft Computing Approaches: A Review

    Optimization of Assembly Sequence Planning Using Soft Computing Approaches: A Review by Muhammad Arif, Abdullah, M. F. F., Ab Rashid, Z., Ghazalli

    Published 2019
    “…This review focused on ASP modeling approach, optimization algorithms and optimization objectives. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    Design and development of high performance swa cell design for local DNA sequence alignment / Syed Abdul Mutalib Al Junid Syed Abdul Rahman

    Design and development of high performance swa cell design for local DNA sequence alignment / Syed Abdul Mutalib Al Junid Syed Abdul Rahman by Syed Abdul Rahman, Syed Abdul Mutalib Al Junid

    Published 2017
    “…This study proposed three new DNA sequence alignment accelerator system cell design and architecture based on the Smith-Waterman Algorithm (SWA) named as the new Optimized SWA Linear Gap Penalty (OSL), Optimized SWA Affine Gap Penalty (OSA), and Optimized Recursive Variable Expansion SWA Linear Gap Penalty (ORSL).…”
    Get full text
    Get full text
    Book Section
    Save to List
    Saved in:
  14. 14
    Improving Attentive Sequence-to-Sequence Generative-Based Chatbot Model Using Deep Neural Network Approach

    Improving Attentive Sequence-to-Sequence Generative-Based Chatbot Model Using Deep Neural Network Approach by Wan Solehah, Wan Ahmad

    Published 2022
    “…Hence, this research’s objective aimed to propose an optimization strategy based on Structural Modification and Optimizing Training Network for improving the lacking of accuracy of response in the chatbot application, to propose the algorithm enhancement to improve the current attention mechanism in the Attentive Sequence-to-Sequence model and the network’s training optimization of its inability to memorize the dialogue history, and lastly, to evaluate the accuracy of response of the proposed solution through data training on loss function and real data testing. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    New completion time algorithms for sequence based scheduling in multiproduct batch processes using matrix

    New completion time algorithms for sequence based scheduling in multiproduct batch processes using matrix by Shafeeq , A., M.I., Abdul Mutalib, Amminudin , K.A., Muhammad , A.

    Published 2008
    “…These models require good understanding in formulating the problem using programming techniques to find the optimal solution. The current work proposes new completion time algorithms for multiproduct batch process with two commonly used transfer policies namely zero wait (ZW) and no intermediate storage (NIS). …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Process Sequencing Modeled as TSP with Precedence Constraints - A Genetic Algorithm Approach

    Process Sequencing Modeled as TSP with Precedence Constraints - A Genetic Algorithm Approach by N. M., Razali

    Published 2014
    “…The procedure to select the task in sequence is based on “earliest position” techniques. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Multilevel optimization for dense motion estimation

    Multilevel optimization for dense motion estimation by Saaban, Azizan, Kalmoun, El Mostafa, Ibrahim, Haslinda, Ramli, Razamin, Omar, Zurni

    Published 2011
    “…We evaluated the performance of different optimization techniques developed in the context of optical flow computation with different variational models.In particular, based on truncated Newton methods (TN) that have been an effective approach for large-scale unconstrained optimization, we developed the use of efficient multilevel schemes for computing the optical flow.More precisely, we evaluated the performance of a standard unidirectional multilevel algorithm - called multiresolution optimization (MR/Opt), to a bidrectional multilevel algorithm - called full multigrid optimization (FMG/Opt).The FMG/Opt algorithm treats the coarse grid correction as an optimization search direction and eventually scales it using a line search. …”
    Get full text
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  18. 18
    Block based motion vector estimation using fuhs16 uhds16 and uhds8 algorithms for video sequence

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

    Published 2011
    “…There are several block-matching algorithm based on block-based motion estimation techniques have been developed. …”
    Get full text
    Get full text
    Get full text
    Book Chapter
    Save to List
    Saved in:
  19. 19
    Design and analysis of sequence generator module using eulerian path algorithm for DNA fragment assembly: article / Mustaqim Mohd Subri

    Design and analysis of sequence generator module using eulerian path algorithm for DNA fragment assembly: article / Mustaqim Mohd Subri by Mohd Subri, Mustaqim

    Published 2013
    “…This project is designed based on speed optimization. DNA fragment assembly is a process reassembling fragment of DNA like a puzzle into several other sequence. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Development of Simulated Annealing Based Scheduling Algorithm for Two Machines Flow Shop Problem

    Development of Simulated Annealing Based Scheduling Algorithm for Two Machines Flow Shop Problem by M., Muziana, Kamal Z., Zamli

    Published 2015
    “…Due to costing requirements and time delivery constraints, continuous flow of processing tasks is desired within completion time and with minimum of due date time. Viewing as optimization problem and focusing on two machines, this research aims to develop a new Simulated Annealing based scheduling algorithm, called SA2M, for flow shop problem. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:

Search Tools: