Search Results - candidate ((generation algorithm) OR (optimisation algorithm))

Search alternatives:

Refine Results
  1. 1
    A competitive co-evolutionary approach for the nurse scheduling problem

    A competitive co-evolutionary approach for the nurse scheduling problem by Mohamad Nazri, Maizatul Farhana, Mohd Yusoh, Zeratul Izzah, Basiron, Halizah, Daud, Azlina

    Published 2026
    “…The competitive approach further exhibits smoother convergence behaviour across generations, indicating stronger optimisation dynamics and improved robustness. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    Capacitor bank placement in radial distribution system using particle swarm optimization algorithm

    Capacitor bank placement in radial distribution system using particle swarm optimization algorithm by Muhammad Naufal Charles Abdullah

    Published 2023
    text::Final Year Project
    Save to List
    Saved in:
  3. 3
    Hyper-heuristic approaches for data stream-based iIntrusion detection in the Internet of Things

    Hyper-heuristic approaches for data stream-based iIntrusion detection in the Internet of Things by Hadi, Ahmed Adnan

    Published 2022
    “…On the other hand, existing stream data learning models with limited labelling have many limitations. Most importantly, algorithms that suffer from a limited capability to adapt to the evolving nature of data generated from network traffic are called concept drift. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    Efficient and secured compression and steganography technique in wireless sensor network

    Efficient and secured compression and steganography technique in wireless sensor network by Tuama, Ammar Yaseen

    Published 2016
    “…Furthermore, some analyses on hiding quality show that our algorithm retains the cover image quality as high as that of standard LSB algorithm. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    Adaptive beamforming of steerable array monopole antenna for WLAN application

    Adaptive beamforming of steerable array monopole antenna for WLAN application by Amer Asem, Abdullah

    Published 2018
    “…The proposed approach can be considered a fast and significant candidate for new generation of smart communication WLAN applications.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    An improved Levenshtein algorithm for spelling correction word candidate list generation

    An improved Levenshtein algorithm for spelling correction word candidate list generation by Abdulkhudhur, Hanan Najm

    Published 2016
    “…The most widely used algorithm for generating candidates’ list for incorrect words is based on Levenshtein distance. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Implementation of improved Levenshtein algorithm for spelling correction word candidate list generation

    Implementation of improved Levenshtein algorithm for spelling correction word candidate list generation by Abdulkhudur, Hanan Najm, Habeeb, Imad Q., Yusof, Yuhanis, Mohd Yusof, Shahrul Azmi

    Published 2016
    “…The most widely used algorithm to generate the candidate list is the Levenshtein algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Web-based expert system for material selection of natural fiber- reinforced polymer composites

    Web-based expert system for material selection of natural fiber- reinforced polymer composites by Ahmed Ali, Basheer Ahmed

    Published 2015
    “…The computational tool, Matlab was proposed for classification with Levenberg-Marquardt training algorithm, which provided faster rate of convergence for feed forward network. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Application of Shuffled Frog Leaping Algorithm (SFLA) to long term generation expansion planning / Nurul Ulya Ibrahim

    Application of Shuffled Frog Leaping Algorithm (SFLA) to long term generation expansion planning / Nurul Ulya Ibrahim by Ibrahim, Nurul Ulya

    Published 2016
    “…This method is tested for 15 existing power plant and five generation candidates within 10 years of planning. The simulation results obtained using the proposed algorithm show that the minimum cost can be obtained for types of candidate.…”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Hybrid genetic algorithm for uncapacitated university examination timetabling problem

    Hybrid genetic algorithm for uncapacitated university examination timetabling problem by Ishak, Suhada

    Published 2015
    “…The main components of the genetic operators in a Genetic Algorithm (GA) will be tested and the best combination of the genetic operators will be adopted to construct a Pure Genetic Algorithm (PGA). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Using unique-prime-factorization theorem to mine frequent patterns without generating tree

    Using unique-prime-factorization theorem to mine frequent patterns without generating tree by Tohidi, Hossein, Ibrahim, Hamidah

    Published 2011
    “…For huge database it may need to generate a huge number of candidate sets. An interest solution is to design an approach that without generating candidate is able to mine frequent patterns. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    Hybrid genetic algorithm for university examination timetabling problem

    Hybrid genetic algorithm for university examination timetabling problem by Ishak, Suhada, Lee, Lai Soon, Ibragimov, Gafurjan

    Published 2016
    “…The main components of the genetic operators in a GA will be tested and the best combination of the genetic operators will be adopted to construct a Pure Genetic Algorithm (PGA). The PGA will then hybridised with three new local optimisation techniques, which will make up the HGA; to improve the solutions found. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    Direct approach for mining association rules from structured XML data

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

    Published 2012
    “…Another aim of this study is to do an enhancement on the current structure of FLEX algorithm in terms of elimination of the candidate generation step. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    3D face candidate region detection using background subtraction / Zulfikri Paidi and Nurzaid Muhd Zain

    3D face candidate region detection using background subtraction / Zulfikri Paidi and Nurzaid Muhd Zain by Paidi, Zulfikri, Muhd Zain, Nurzaid

    Published 2016
    “…From the experiment, it shows some promising results related to using background subtraction in face candidate region detection algorithm. Firstly, we have succeeded in generating an oval shape for boundary region detection. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Optimizing S-box generation based on the Adaptive Agent Heroes and Cowards Algorithm

    Optimizing S-box generation based on the Adaptive Agent Heroes and Cowards Algorithm by Kamal Z., Zamli

    Published 2021
    “…This paper introduces a new variant of a metaheuristic algorithm based on Agent Heroes and Cowards Algorithm (AHC), called Adaptive Agent Heroes and Cowards Algorithm (AAHC). …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    PMT : opposition based learning technique for enhancing metaheuristic algorithms performance

    PMT : opposition based learning technique for enhancing metaheuristic algorithms performance by Hammoudeh, S. Alamri

    Published 2020
    “…Unlike existing OBL-based techniques, the PMT generates more than one candidate in multiple solution-space directions. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    A frequent pattern mining algorithm based on FP-growth without generating tree

    A frequent pattern mining algorithm based on FP-growth without generating tree by Tohidi, Hossein, Ibrahim, Hamidah

    Published 2010
    “…In this paper we introduce an algorithm to generate frequent patterns without generating a tree and therefore improve the time complexity and memory complexity as well. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  18. 18
    A frequent pattern mining algorithm based on FP-growth without generating tree

    A frequent pattern mining algorithm based on FP-growth without generating tree by Tohid, Hossein, Ibrahim, Hamidah

    Published 2010
    “…It then divides the compressed database into a set of conditional databases (a special kind of projected database), each associated with one frequent item or pattern fragment, and mines each such database separately.For a large database, constructing a large tree in the memory is a time consuming task and increase the time of execution.In this paper we introduce an algorithm to generate frequent patterns without generating a tree and therefore improve the time complexity and memory complexity as well.Our algorithm works based on prime factorization, and is called Frequent Pattern- Prime Factorization (FPPF).…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  19. 19
    PMT: opposition-based learning technique for enhancing meta-heuristic performance

    PMT: opposition-based learning technique for enhancing meta-heuristic performance by Alamri, Hammoudeh S., Kamal Z., Zamli

    Published 2019
    “…Unlike existing OBL-based techniques, the PMT generates more than one candidate in multiple solution-space directions. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Prescription: Issue No. 7 (July 2024)

    Prescription: Issue No. 7 (July 2024) by UiTM, Faculty of Pharmacy

    Published 2024
    “…In pharmaceutical research, ML accelerates the identification of potential drug candidates, improves design optimisation, and increases research efficiency. …”
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:

Search Tools: