Search Results - (( location selection (search OR research) algorithm ) OR ( panel optimisation system algorithm ))*

Refine Results
  1. 1

    Harmony search algorithm for curriculum-based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2013
    “…In this paper, harmony search algorithm is applied to curriculum-based course timetabling.The implementation, specifically the process of improvisation consists of memory consideration, random consideration and pitch adjustment.In memory consideration, the value of the course number for new solution was selected from all other course number located in the same column of the Harmony Memory.This research used the highest occurrence of the course number to be scheduled in a new harmony.The remaining courses that have not been scheduled by memory consideration will go through random consideration, i.e. will select any feasible location available to be scheduled in the new harmony solution. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    Harmony search algorithm for curriculum-based course timetabling problem by Wahid, Juliana, Mohd Hussin, Naimah

    Published 2013
    “…In this paper, harmony search algorithm is applied to curriculum-based course timetabling.The implementation, specifically the process of improvisation consists of memory consideration, random consideration and pitch adjustment.In memory consideration, the value of the course number for new solution was selected from all other course number located in the same column of the Harmony Memory.This research used the highest occurrence of the course number to be scheduled in a new harmony.The remaining courses that have not been scheduled by memory consideration will go through random consideration, i.e. will select any feasible location available to be scheduled in the new harmony solution.Each course scheduled out of memory consideration is examined as to whether it should be pitch adjusted with probability of eight procedures. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  3. 3
  4. 4

    Performance Enhancement Of Artificial Bee Colony Optimization Algorithm by Abro, Abdul Ghani

    Published 2013
    “…To overcome the problems, this research work has proposed few modified and new ABC variants; Gbest Influenced-Random ABC (GRABC) algorithm systematically exploits two different mutation equations for appropriate exploration and exploitation of search-space, Multiple Gbest-guided ABC (MBABC) algorithm enhances the capability of locating global optimum by exploiting so-far-found multiple best regions of a search-space, Enhanced ABC (EABC) algorithm speeds up exploration for optimal-solutions based on the best so-far-found region of a search-space and Enhanced Probability-Selection ABC (EPS-ABC) algorithm, a modified version of the Probability-Selection ABC algorithm, simultaneously capitalizes on three different mutation equations for determining the global-optimum. …”
    Get full text
    Get full text
    Thesis
  5. 5
  6. 6

    Using artificial intelligence search in solving the camera placement problem by Altahir, A.A., Asirvadam, V.S., Hamid, N.H.B., Sebastian, P.

    Published 2022
    “…The chapter also carries out an analytical review of three main searching algorithms namely, generate and test, uninformed search, and hill climbing search algorithms. …”
    Get full text
    Get full text
    Book
  7. 7

    Edge Detection Algorithm For Image Processing Of Search And Rescue Robot by A/L Sivem, Prasanthran

    Published 2016
    “…This project entitled “ Edge Detection Algorithm for Image Processing of Search and Rescue Robot ” has its primary purpose to identify an optimum edge detection algorithm for image processing of search and rescue robot. …”
    Get full text
    Get full text
    Final Year Project
  8. 8

    Linear-pso with binary search algorithm for DNA motif discovery / Hazaruddin Harun by Harun, Hazaruddin

    Published 2015
    “…The Linear-PSO algorithm was the first version of improvement. However due to the longer time required for complete execution of this algorithm, the Binary Search technique was integrated and a new version of the algorithm was developed, namely the Linear-PSO with Binary Search (LPBS) algorithm. …”
    Get full text
    Get full text
    Thesis
  9. 9

    Static and self-scalable filter range selection algorithms for peer-to-peer networks by Kweh, Yeah Lun

    Published 2011
    “…Two multiple selection algorithm, which are known as “static filter range selection algorithm” and “self-scalable selection algorithm” are proposed. …”
    Get full text
    Get full text
    Thesis
  10. 10

    A Multidimensional Search Space Using Interactive Genetic Algorithm by Farooq, H., Zakaria, M.N., Hassan, M.F., Sulaiman, Suziah

    Published 2010
    “…This paper applied an Interactive Genetic Algorithm (IGA) technique to design an visualization environment for search space. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    Hybridization of Strength Pareto Multiobjective Optimization with Modified Cuckoo Search Algorithm for Rectangular Array by Abdul Rani, Khairul Najmi, Abdulmalek, Mohamed Fareq, Rahim, Hasliza, Siew Chin, Neoh, Abd Wahab, Alawiyah

    Published 2017
    “…This research proposes the various versions of modified cuckoo search (MCS) metaheuristic algorithm deploying the strength Pareto evolutionary algorithm (SPEA) multiobjective (MO) optimization technique in rectangular array geometry synthesis.Precisely, the MCS algorithm is proposed by incorporating the Roulette wheel selection operator to choose the initial host nests (individuals) that give better results, adaptive inertia weight to control the positions exploration of the potential best host nests (solutions), and dynamic discovery rate to manage the fraction probability of finding the best host nests in 3-dimensional search space. …”
    Get full text
    Get full text
    Get full text
    Article
  12. 12
  13. 13
  14. 14
  15. 15
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20