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

Search alternatives:

Refine Results
  1. 1
    A generalized laser simulator algorithm for optimal path planning in constraints environment

    A generalized laser simulator algorithm for optimal path planning in constraints environment by Aisha, Muhammad

    Published 2022
    “…The results demonstrated that the proposed method could generate an optimal collision-free path. Moreover, the proposed algorithm result are compared to some common algorithms such as the A* algorithm, Probabilistic Road Map, RRT, Bi-directional RRT, and Laser Simulator algorithm to demonstrate its effectiveness. …”
    Get full text
    Thesis
    Save to List
    Saved in:
  2. 2
    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:
  3. 3
    Enhanced Harris's Hawk algorithm for continuous multi-objective optimization problems

    Enhanced Harris's Hawk algorithm for continuous multi-objective optimization problems by Yasear, Shaymah Akram

    Published 2020
    “…The algorithm includes (i) a population update strategy which improves the movement of hawks in the search space, (ii) a parameter adjusting strategy to control the transition between exploration and exploitation, and (iii) a population generating method in producing the initial candidate solutions. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    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:
  5. 5
    Development of heuristic methods based on genetic algorithm (GA) for solving vehicle routing problem

    Development of heuristic methods based on genetic algorithm (GA) for solving vehicle routing problem by Ismail, Zuhaimy, Nurhadi, Irhamah, Zainuddin, Zaitul Marlizawati

    Published 2008
    “…The computational complexity of most vehicle routing problem and moreover the intricate of stochastic VRP algorithm has made them an important candidate for solution using metaheuristics. …”
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  6. 6
    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:
  7. 7
    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:
  8. 8
    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:
  9. 9
    A greedy heuristics multiple criteria model for solving multi-landfill site selection and plant propagation algorithm for improving waste collection vehicle routing solutions

    A greedy heuristics multiple criteria model for solving multi-landfill site selection and plant propagation algorithm for improving waste collection vehicle routing solutions by Nur Azriati, Mat

    Published 2023
    “…Second, the Plant Propagation Algorithm (PPA) has never been considered to solve WCVRP. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Differential evolution for urban transit routing problem

    Differential evolution for urban transit routing problem by Buba, Ahmed Tarajo, Lai, Soon Lee

    Published 2016
    “…This is an NP-hard problem, where the generation of candidate route sets can lead to a number of potential routes being discarded on the grounds of infeasibility. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    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:
  12. 12
    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:
  13. 13
    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:
  14. 14
    Integration Of Travel Time Zone For Optimal Siting Of Emergency Facilities

    Integration Of Travel Time Zone For Optimal Siting Of Emergency Facilities by Indriasari, Vini

    Published 2008
    “…The MSAP is a discrete model where a specified number of facilities that achieve the best objective function value of the model are selected out of a finite set of candidate sites. A method involving multi criteria analysis was introduced to determine candidate sites in a per zone basis. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    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:
  16. 16
    APPLICATION OF LINK GRAMMAR IN SEMI-SUPERVISED NAMED ENTITY RECOGNITION FOR ACCIDENT DOMAIN

    APPLICATION OF LINK GRAMMAR IN SEMI-SUPERVISED NAMED ENTITY RECOGNITION FOR ACCIDENT DOMAIN by SARI, YUNITA SARI

    Published 2011
    “…The algorithm reduces the training efforts and generates almost similar result as compared to the conventional supervised learning technique. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Analysis of Sentiment Based on Opinions from the 2019 Presidential Election

    Analysis of Sentiment Based on Opinions from the 2019 Presidential Election by Nurul Adha Oktarini, Saputri, Misinem, ., Khoirul, Zuhri

    Published 2024
    “…The Naive Bayes Classifier algorithm was employed to classify the tweet data. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    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:
  19. 19
    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:
  20. 20
    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:

Search Tools: