Search Results - (( data optimization max algorithm ) OR ( sequence optimization based algorithm ))

Refine Results
  1. 1

    Dynamic transmit antenna shuffling scheme for hybrid multiple-input multiple-output in layered architecture by Chong, Jin Hui

    Published 2010
    “…Dynamic transmit antenna shuffling scheme improves the performance of MIMO by selecting the appropriate pairs of antennas at transmitter based on the CSI from receiver. Two dynamic transmit antenna shuffling schemes, namely ‘Optimal’ and ‘Max STBC’, are proposed to enhance the V-BLAST/STBC transceiver scheme with LC-QR proposed in the first part. …”
    Get full text
    Get full text
    Thesis
  2. 2

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

    Digital Signal Processor (DSP) Design Using Very Long Instruction Word (VLIW) Architecture by Lee, Lini @ Lini Lee

    Published 2001
    “…Using, VHDL (Very-High-Speed-Integrated-Circuit Hardware Description Language) as design tool has the advantage in optimizing the pDSP hardware requirement with ease where varying the size of units such as register files (RF), program sequencer (PS), data address generator (DAG), arithmetic logic unit (ALU), multiply-accumulator (MAC) and shifter can be done by changing the data width or bit values. …”
    Get full text
    Get full text
    Thesis
  4. 4
  5. 5

    Reactive max-min ant system: An experimental analysis of the combination with K-OPT local searches by Sagban, Rafid, Ku-Mahamud, Ku Ruhana, Abu Bakar, Muhamad Shahbani

    Published 2015
    “…The exploration versus exploitation dilemma rises in ACO search.Reactive max-min ant system algorithm is a recent proposition to automate the exploration and exploitation.It memorizes the search regions in terms of reactive heuristics to be harnessed after restart, which is to avoid the arbitrary exploration later.This paper examined the assumption that local heuristics are useless when combined with local search especially when it applied for combinatorial optimization problems with rugged fitness landscape.Results showed that coupling reactive heuristics with k-Opt local search algorithms produces higher quality solutions and more robust search than max-min ant system algorithm.Well-known combinatorial optimization problems are used in experiments, i.e. traveling salesman and quadratic assignment problems. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  6. 6

    An improvement of stochastic gradient descent approach for mean-variance portfolio optimization problem by S. W. Su, Stephanie, Kek, Sie Long

    Published 2021
    “…Furthermore, the applicability of SGD, Adam, AdaMax, Nadam, AMSGrad, and AdamSE algorithms in solving the mean-variance portfolio optimization problem is validated.…”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

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

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

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

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

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

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

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

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

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

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

    BASE: a bacteria foraging algorithm for cell formation with sequence data by Nouri, Hossein, Tang, Sai Hong, Baharudin, B. T. Hang Tuah, Mohd Ariffin, Mohd Khairol Anuar

    Published 2010
    “…In addition, a newly developed BFA-based optimization algorithm for CF based on operation sequences is discussed. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19

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

    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
    “…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