Search Results - (( basic optimization method algorithm ) OR ( set generation method algorithm ))

Refine Results
  1. 1

    Optimal power flow based on fuzzy linear programming and modified Jaya algorithms by Alzihaymee, Warid Sayel Warid

    Published 2017
    “…Meanwhile, the proposed QOJaya algorithm produces better results than the basic Jaya method in terms of solution optimality and convergence speed. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Model of Improved a Kernel Fast Learning Network Based on Intrusion Detection System by Ali, Mohammed Hasan, Mohamed Fadli, Zolkipli

    Published 2019
    “…The input weights and hidden layer biases are randomly generated. In this paper, the particle swan optimization algorithm (PSO) was used to obtain an optimal set of initial parameters for Reduce Kernel FLN (RK-FLN), thus, creating an optimal RKFLN classifier named PSO-RKELM. …”
    Get full text
    Get full text
    Conference or Workshop Item
  3. 3

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

    Published 2009
    “…These problems are known as discrete-valued optimal control problems. Most practical discrete-valued optimal control problems have multiple local minima and thus require global optimization methods to generate practically useful solutions. …”
    Get full text
    Get full text
    Get full text
    Thesis
  4. 4

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

    Published 2022
    “…The adoption of DNN method into chatbot application produces a new generation chatbot that called as Generative-Based Chatbot. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  5. 5

    Hybrid-discrete multi-objective particle swarm optimization for multi-objective job-shop scheduling by Anuar, Nurul Izah

    Published 2022
    “…In order to accomplish better performance by improving the search quality and efficiency of the discrete MOPSO, this research proposes a hybrid with the Diversification Generation Method in Scatter Search, the non-dominated sorting mechanism in non-dominated sorting Genetic Algorithm II (NSGA-II) and the local search mechanism in Tabu Search. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

    Inversion of 2D and 3D DC resistivity imaging data for high contrast geophysical regions using artificial neural networks / Ahmad Neyamadpour by Neyamadpour, Ahmad

    Published 2010
    “…These methods are M1 and M2, and they basically differ in the type of input-output data used to train the artificial neural network. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Particle swarm optimization (PSO) for CNC route problem by Nur Azia Azwani, Ismail

    Published 2002
    “…We often see many of the method of Genetic Algorithm (GA), Ant Colony Optimization (ACO), Simulated Annealing Algorithm (SAA) and PSO are used for any optimization problems. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  8. 8

    Voting algorithms for large scale fault-tolerant systems by Karimi, Abbas

    Published 2011
    “…To solve this problem and gain benefits of this algorithm, we employed parallel algorithm technique and by using optimal number of processors, we could propose optimal algorithms known as Parallel Average Voting and Parallel Weighted Average Voting which both have optimal time complexity and less calculation cost. …”
    Get full text
    Get full text
    Thesis
  9. 9

    SEALiP: A simple and efficient algorithm for listing permutation via starter set method by Ibrahim, Haslinda, Zake, Lugean, Omar, Zurni, Karim, Sharmila

    Published 2013
    “…Algorithm for listing permutations for n elements is an arduous task.This paper attempts to introduce a novel method for generating permutations.The fundamental concept for this method is to seek a starter set to begin with as an initial set to generate all distinct permutations. …”
    Get full text
    Get full text
    Get full text
    Article
  10. 10
  11. 11

    Comparison between starter sets generation method for listing all permutations by Karim, Sharmila, Ibrahim, Haslinda, Omar, Zurni

    Published 2013
    “…distinct permutations is an exhaustive process.Using starter set, the process of listing the permutations becomes easy.However a problem arises when the equivalence starter sets will generate the similar permutation and needed to be discarded.Two new recursive strategies are proposed to generate starter sets without generating equivalence starter sets namely circular and exchange two elements operation.Once the starter sets are obtained, the circular and reverse of circular operation are employed to produce distinct permutation from each starter sets.Computational advantages are presented comparing the results obtained by the new method with two other existing methods.The result indicates that the exchange two elements based strategy is faster than the circular based.Overall all new algorithms are better than existing algorithms in time execution.…”
    Get full text
    Get full text
    Conference or Workshop Item
  12. 12

    Using Electromagnetism-like algorithm and genetic algorithm to optimize time of task scheduling for dual manipulators by Abed I.A., Sahari K.S.M., Koh S.P., Tiong S.K., Jagadeesh P.

    Published 2023
    “…A method based on Electromagnetism-Like algorithm (EM) and Genetic Algorithm (GA) is proposed to determine the time-optimal task scheduling for dual robot manipulators. …”
    Conference paper
  13. 13

    A permutation parallel algorithm under exchange restriction with message passing interface by Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda

    Published 2014
    “…The permutation generation method is based on starter sets generation under exchange operation and exploited it for listing down all n! …”
    Get full text
    Get full text
    Conference or Workshop Item
  14. 14

    Improved Multi-Verse Optimizer In Text Document Clustering For Topic Extraction by Abasi, Ammar Kamal Mousa

    Published 2021
    “…Second, three multi-verse optimizer algorithm (MVOs), namely, basic MVO, modified MVO, hybrid MVO is proposed to solve the TDC problem; these algorithms are incremental improvements of the preceding versions. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Synthesis of transistor chaining algorithm for CMOS cell layout using euler path / Sukri Hanafiah by Hanafiah, Sukri

    Published 1997
    “…After discussing about the introduction (the basic of CMOS transistor ), we will discuss how to create the Optimal layout of CMOS Functional Array with the minimum separation based on euler path method. …”
    Get full text
    Get full text
    Thesis
  16. 16

    Direct approach for mining association rules from structured XML data by Abazeed, Ashraf Riad

    Published 2012
    “…The experiments were conducted on self generated data sets (7 different sets) and well known datasets (Mushroom & Cars Data set). …”
    Get full text
    Get full text
    Thesis
  17. 17

    Algorithm development for optimization of a refrigeration system by Izzat, Mohamad Adnan

    Published 2010
    “…This thesis deals with algorithm development for optimization of a refrigeration system. …”
    Get full text
    Get full text
    Undergraduates Project Papers
  18. 18

    Genetic algorithm based method for optimal location placement of flexible ac transmission system devices for voltage profile improvement by Karami, Mahdi

    Published 2011
    “…This thesis present a genetic algorithm based method for placement of FACTS devices for voltage profile improvement. …”
    Get full text
    Get full text
    Thesis
  19. 19

    A new starter sets generation method by fixing any element under exchange restriction by Karim, Sharmila, Ibrahim, Haslinda, Omar, Zurni, Sapiri, Hasimah

    Published 2016
    “…Permutation array are of recent interest because of their application to data transmission over power lines.A new permutation technique based on distinct starter sets by employing circular and reversing operations.The crucial task is to generate the distinct starter sets by eliminating the equivalence starter sets.Meanwhile a new strategy for starter sets generation without generating its equivalence starter sets were developed and more efficient in terms of computation time compared to old method. …”
    Get full text
    Get full text
    Article
  20. 20

    A new method for starter sets generation by fixing any element by Karim, Sharmila, Ibrahim, Haslinda, Sapiri, Hasimah

    Published 2015
    “…a new permutation technique based on distinct starter sets was introduced by employing circular and reversing operations.The crucial task is to generate the distinct starter sets by eliminating the equivalence starter sets.Meanwhile new strategies for starter sets generation without generating its equivalence starter sets were developed and more efficient in terms of computation time compared to old method.However all these algorithms have limitations in terms of fixing element to construct the first set (starter set) to begin with.It would be interesting to derive new strategy by fixing an element in any position. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item