Search Results - (( using function new algorithm ) OR ( sequence optimization based algorithm ))

Refine Results
  1. 1

    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
  2. 2

    Iteration strategy and ts effect towards the performance of population based metaheuristics by Nor Azlina, Ab. Aziz, Nor Hidayati, Abdul Aziz, Azlan, Abd Aziz, Tasiransurini, Abdul Rahman, Wan Zakiah, Wan Ismail, Zuwairie, Ibrahim

    Published 2020
    “…This is an important issue to be considered when designing a new population-based metaheuristic. Three parent algorithms, namely, particle swarm optimization (PSO), gravitational search algorithm (GSA), and simulated Kalman filter (SKF) are used in this work to find a general pattern of the effect of iteration strategy towards the performance of population-based algorithms. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  3. 3

    Biological-based semi-supervised clustering algorithm to improve gene function prediction by Kasim, Shahreen, Deris, Safaai, M. Othman, Razib, Hashim, Rathiah

    Published 2011
    “…However, commonclustering algorithms do not provide a comprehensive approach that look into the three categories of annotations; biologicalprocess, molecular function, and cellular component, and were not tested with different functional annotation database formats.Furthermore, the traditional clustering algorithms use random initialization which causes inconsistent cluster generation and areunable to determine the number of clusters involved. …”
    Get full text
    Get full text
    Article
  4. 4

    Modified firefly algorithm for directional overcurrent relay coordination in power system protection / Muhamad Hatta Hussain by Hussain, Muhamad Hatta

    Published 2020
    “…The objectives of the studies are to develop a new optimization technique termed as Modified Firefly Algorithm (MFA) for minimizing the relay operating time, to develop a Multi-Objective Modified Firefly Algorithm (MOMFA) for minimizing both the total relay operating time and relay coordination time and to develop an integrated optimal predictor termed as Modified Firefly Algorithm-Artificial Neural Network (MFA-ANN) for accurate prediction of relay operating time. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Global Algorithms for Nonlinear Discrete Optimization and Discrete-Valued Optimal Control Problems by Woon, Siew Fang

    Published 2009
    “…The transformation results in an equivalent mixed discrete optimization problem. The transformed problemis then decomposed into a bi-level optimization problem, which is solved using a combination of an efficient discrete filled function method identified earlier and a computational optimal control technique based on the concept of control parameterization. …”
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

    Angle Based Protein Tertiary Structure Prediction Using Bees Optimization Algorithm by Al-Qattan, Zakaria Noor Aldeen Mahmood

    Published 2010
    “…In this project, angles based control with Bees Optimization search algorithm were adopted to search with guidance the protein conformational space in order to find the optimum solution. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7

    Particle swarm optimization with partial search to solve traveling salesman problem by Akhand, M.A.H., Akter, Shahina, Rahman, S. Sazzadur, Rahman, M.M. Hafizur

    Published 2012
    “…The proposed PSO with Partial Search (PSOPS) algorithm is shown to produce optimal solution within a less number of generation than standard PSO, Genetic Algorithm in solving benchmark TSP.…”
    Get full text
    Get full text
    Proceeding Paper
  8. 8

    Topology-aware hypergraph based approach to optimize scheduling of parallel applications onto distributed parallel architectures by Koohi, Sina Zangbari

    Published 2020
    “…For these reasons, to improve the time and accuracy of the coverage in population-based meta-heuristics and their utilization in HPAs, this thesis presents a novel optimization algorithm called the Raccoon Optimization Algorithm (ROA). …”
    Get full text
    Get full text
    Thesis
  9. 9

    Design and analysis of 4x4 Smith Waterman’s based DNA sequences alignment accelerator using multicore architecture: article by Mohd Najib, Nur Fariza

    Published 2011
    “…This paper presents the design and analysis of 4x4 Smith Waterman’s based DNA sequences alignment accelerator using multicore architecture. …”
    Get full text
    Get full text
    Article
  10. 10

    Design and analysis of 4x4 smith waterman's based DNA alignment accelerator using multicore architecture by Mohd Najib, Nur Fariza

    Published 2011
    “…This paper presents the design and analysis of 4x4 Smith Waterman’s based DNA sequences alignment accelerator using multicore architecture. …”
    Get full text
    Get full text
    Student Project
  11. 11

    A study on component-based technology for development of complex bioinformatics software by Ali Shah, Zuraini, Deris, Safaai, Othman, Muhamad Razib, Zakaria, Zalmiyah, Saad, Puteh, Hassan, Rohayanti, Muda, Mohd. Hilmi, Kasim, Shahreen, Roslan, Rosfuzah

    Published 2004
    “…The second layer uses discriminative SVM algorithm with a state-of-the-art string kernel based on PSI-BLAST profiles that is used to leverage the unlabeled data. …”
    Get full text
    Get full text
    Monograph
  12. 12

    Multiple and solid data background scheme for testing static single cell faults on SRAM memories by Zakaria, Nor Azura

    Published 2013
    “…Therefore, the purpose of this thesis is to introduce a Data Background (DB) scheme to generate an optimal March Test Algorithm (MTA) for detecting faults of memory that are undetectable using existing algorithms. …”
    Get full text
    Get full text
    Thesis
  13. 13

    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 improve the performance of the swap sequence based PSO, this paper introduces an Enhanced Swap Sequence based PSO (Enhanced SSPSO) algorithm by integrating the strategies of the Expanded PSO (XPSO) in the swap sequence based PSO. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Antenna arrays in multi-user detection of spread spectrum signals by Karim, M.R., Wei, S.

    Published 2007
    “…A number of multi-user detection algorithms have been suggested by various authors. Optimal receivers based upon maximum likelihood sequence decoding are quite complex, their complexity increasing exponentially with the number of users in the system. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  15. 15

    Optimal Maintenance Scheduling for Multi-Component E-Manufacturing System by Arab, Ali

    Published 2009
    “…Then, using genetic algorithm-based software which is called SimRunner and has been embedded by ProModel, the scheduling optimization procedure is run to find optimum maintenance schedule. …”
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17

    Product assembly and disassembly sequence optimization based on genetic algorithm and design for assembly methodologies by Yasin, Azman, Puteh, Nurnasran, Daud, Ruslizam

    Published 2009
    “…In this paper, an Artificial Intelligence (AI) technique, namely Genetic Algorithm (GA) is proposed to optimize product components assembly and disassembly sequences.The proposed methodology is developed and tested on an industrial product made of plastics with no integrated assembly and permanent joint parts.GA method is applied to determine the accuracy and optimum results based on 20 assembly and disassembly sequence solutions that was generated by the Design for Assembly methodology.The results indicated that GA based approach is able to obtain a near optimal solution for assembly and disassembly sequences.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18

    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
  19. 19

    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
  20. 20

    Efficient Entropy-Based Decoding Algorithms For Higher-Order Hidden Markov Model by Chan, Chin Tiong

    Published 2019
    “…The required memory of this algorithm is also time independent. In addition, the optimal state sequence obtained by the EVRA algorithm is the same as that obtained by the classical Viterbi algorithm for HHMM.…”
    Get full text
    Get full text
    Thesis