Search Results - (( integer implementation case algorithm ) OR ( evolution optimization mining algorithm ))

Refine Results
  1. 1

    Y-type Random 2-satisfiability In Discrete Hopfield Neural Network by Guo, Yueling

    Published 2024
    “…During the retrieval phase, a new activation function and Swarm Mutation were proposed to ensure the diversity of the neuron states. The proposed algorithm and mutation mechanism showed optimal performances as compared to the existing algorithms. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Case Slicing Technique for Feature Selection by A. Shiba, Omar A.

    Published 2004
    “…Case Slicing Technique (CST) helps in identifying the subset of features used in computing the similarity measures needed by classification algorithms. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Logic mining method via hybrid discrete hopfield neural network by Guo, Yueling, Mohd Kasihmuddin, Mohd Shareduwan, Zamri, Nur Ezlin, Li, Jia, Romli, Nurul Atiqah, Mansor, Mohd Asyraf, Ruzai, Wan Nur Aqlili

    Published 2025
    “…The first contribution involves the incorporation of a Hybrid Differential Evolution Algorithm to accelerate the optimization of synaptic weights during the training phase. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Multi-Objective Hybrid Algorithm For The Classification Of Imbalanced Datasets by Saeed, Sana

    Published 2019
    “…A new self-adaptive hybrid algorithm (CSCMAES) is introduced for optimization. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Seed disperser ant algorithm for optimization / Chang Wen Liang by Chang , Wen Liang

    Published 2018
    “…The Seed Disperser Ant Algorithm (SDAA) is developed based on the evolution or expansion process of Seed Disperser Ant (Aphaenogaster senilis) colony. …”
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

    Development of symbolic algorithms for certain algebraic processes by Abd. Rahman, Ali, Aris, Nor'Aini

    Published 2007
    “…In the case of dense Legendre basis polynomials with a big GCD solution, the modular algorithm is significantly superior to the nonmodular algorithms in higher degree polynomials. …”
    Get full text
    Get full text
    Get full text
    Monograph
  7. 7

    Development of symbolic algorithms for certain algebraic processes by Abd. Rahman, Ali, Aris, Nor'aini

    Published 2007
    “…In the case of dense Legendre basis polynomials with a big GCD solution, the modular algorithm is significantly superior to the nonmodular algorithms in higher degree polynomials. …”
    Get full text
    Get full text
    Get full text
    Monograph
  8. 8

    Reverse logistics network optimizing by genetic algorithm: a case study of automotive wiring harnesses by Sadrnia, Abdolhossein, Ismail, Napsiah, Mohd Ariffin, Mohd Khairol Anuar, Zulkifli, Norzima, Boyer, Omid

    Published 2014
    “…With regards to the complexity of the reverse logistics network, traditional method cannot be implemented for solving them. Thus, an evolutionary algorithm based genetic algorithm (GA) is applied as a solution methodology to solve mixed integer linear programming model and find the optimum solution. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9
  10. 10

    Classification with degree of importance of attributes for stock market data mining by Khokhar, Rashid Hafeez, Md. Sap, Mohd. Noor

    Published 2004
    “…The experimental results show that predictive FDT algorithm can generate a relatively optimal tree without much computation effort (comprehensibility), and WFPRs have a better predictive accuracy of stock market time series data. …”
    Get full text
    Get full text
    Article
  11. 11

    Sequential and parallel multiple tabu search algorithm for multiobjective urban transit scheduling problems by Uvaraja, Vikneswary

    Published 2018
    “…Additionally, the MTS algorithm is also implemented in parallel computing to produce parallel MTS for generating comparable solutions in shorter computational times. …”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13

    Descriptive analysis of patient diet trends at Pantai Hospital Ayer Keroh by Muhidin, Nurain Fatiha

    Published 2025
    “…Without effective data analysis, it is challenging to track dietary trends, assess patient preferences, and optimize meal preparation. To address this problem, this project focuses on enhancing various aspects of healthcare dietary operations by employing CRISP-DM as the methodology to structure the data mining process. …”
    Get full text
    Get full text
    Student Project
  14. 14
  15. 15
  16. 16

    A study on the significance of backlash width values to the performance of the MIQP-based design of MPC by H., Zabiri, Y., Samyudia

    Published 2005
    “…Simulation results via an industrial Fluidized Catalytic Cracking Unit (FCCU) case study are presented to show the significance of precise estimation of the backlash width in ensuring successful implementation of the MIQP-based design of MPC.…”
    Get full text
    Get full text
    Conference or Workshop Item
  17. 17
  18. 18

    Class binarization with self-adaptive algorithm to improve human activity recognition by Zainudin, Muhammad Noorazlan Shah

    Published 2018
    “…Therefore, feature selection using Relief-f with self-adaptive Differential Evolution (rsaDE) algorithm is proposed to select the most significant features. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Propositional satisfiability method in rough classification modeling for data mining by Abu Bakar, Azuraliza

    Published 2002
    “…Two models, Standard Integer Programming (SIP) and Decision Related Integer Programming (DRIP) to represent the minimal reduct computation problem were proposed. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Energy-aware task scheduling for streaming applications on NoC-based MPSoCs by Abd Ishak, Suhaimi Abd Ishak, Wu, Hui, Tariq, Umair Ullah

    Published 2024
    “…Our approach is supported by a set of novel techniques, which include constructing an initial schedule based on a list scheduling where the priority of each task is its approximate successor-tree-consistent deadline such that the workload across all the processors is balanced, a retiming heuristic to transform intraperiod dependencies into inter-period dependencies for enhancing parallelism, assigning an optimal discrete frequency for each task and each message using a Non-Linear Programming (NLP)-based algorithm and an Integer-Linear Programming (ILP)-based algorithm, and an incremental approach to reduce the memory usage of the retimed schedule in case of memory size violations. …”
    Get full text
    Get full text
    Get full text
    Article