Search Results - (( location selection search algorithm ) OR ( based optimization means algorithm ))*

Refine Results
  1. 1

    Fireflyclust: an automated hierarchical text clustering approach by Mohammed, Athraa Jasim, Yusof, Yuhanis, Husni, Husniza

    Published 2017
    “…The proposed clustering method operates based on five phases: data pre-processing, clustering, item re-location, cluster selection and cluster refinement. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    Crossover and mutation operators of real coded genetic algorithms for global optimization problems by Lim, Siew Mooi

    Published 2016
    “…This study is primarily aimed at investigating two issues in genetic algorithm (GA) and one issue in conformational search (CS) problems. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Development of an islanding detection scheme based on combination of slantlet transform and ridgelet probabilistic neural network in distributed generation by Ahmadipour, Masoud

    Published 2019
    “…The error measurements of the proposed method such as Mean Absolute Percentage Error, Mean Absolute Error, And Root Mean Square Error for islanding detection are less than 0.02% for ideal and noisy conditions which shows that the algorithm is not sensitive to noise. …”
    Get full text
    Get full text
    Thesis
  4. 4

    Assessment of suitable hospital location using GIS and machine learning by Almansi, Khaled Y. M.

    Published 2022
    “…First, the conditioning factors were optimized and ranked to identify and select the most correlated factors to predict the suitability of a hospital site by applying the correlation feature selection (CFS) algorithm and the greedy-stepwise search method. …”
    Get full text
    Get full text
    Thesis
  5. 5

    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
  6. 6

    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
  7. 7

    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
  8. 8

    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
  9. 9

    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
  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
  12. 12
  13. 13

    Optimized clustering with modified K-means algorithm by Alibuhtto, Mohamed Cassim

    Published 2021
    “…Among the techniques, the k-means algorithm is the most commonly used technique for determining optimal number of clusters (k). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  14. 14
  15. 15

    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
  16. 16

    Impact of evolutionary algorithm on optimization of nonconventional machining process parameters by B V, Raghavendra, R Annigiri, Anandkumar, Srikatamurthy, JS

    Published 2025
    “…This paper presents the optimization of laser beam machining in additive manufacturing of polymer-based material parameters, specifically focusing on cutting speed, gas pressure of nitrogen, and focal point locations, to achieve optimal mean surface roughness. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    Document clustering based on firefly algorithm by Mohammed, Athraa Jasim, Yusof, Yuhanis, Husni, Husniza

    Published 2015
    “…Document clustering is widely used in Information Retrieval however, existing clustering techniques suffer from local optima problem in determining the k number of clusters.Various efforts have been put to address such drawback and this includes the utilization of swarm-based algorithms such as particle swarm optimization and Ant Colony Optimization.This study explores the adaptation of another swarm algorithm which is the Firefly Algorithm (FA) in text clustering.We present two variants of FA; Weight- based Firefly Algorithm (WFA) and Weight-based Firefly Algorithm II (WFAII).The difference between the two algorithms is that the WFAII, includes a more restricted condition in determining members of a cluster.The proposed FA methods are later evaluated using the 20Newsgroups dataset.Experimental results on the quality of clustering between the two FA variants are presented and are later compared against the one produced by particle swarm optimization, K-means and the hybrid of FA and -K-means. …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18

    Fuzzy C-Mean And Genetic Algorithms Based Scheduling For Independent Jobs In Computational Grid by Lorpunmanee, Siriluck, Md Sap, Mohd Noor, Abdullah, Abdul Hanan

    Published 2006
    “…Our model presents the method of the jobs classifications based mainly on Fuzzy C-Mean algorithm and mapping the jobs to the appropriate resources based mainly on Genetic algorithm. …”
    Get full text
    Get full text
    Article
  19. 19

    Modified archive update mechanism of multi-objective particle swarm optimization in fuzzy classification and clustering by Rashed, Alwatben Batoul

    Published 2022
    “…Among multi-objective evolutionary algorithms proposed in the literature, particle swarm optimization (PSO)-based multi-objective (MOPSO) algorithm has been cited to be the most representative. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Cluster optimization in VANET using MFO algorithm and K-Means clustering by Ramlee, Sham Rizal, Hasan, Sazlinah, K. Subramaniam, Shamala

    Published 2023
    “…Proven to be an effective and efficient method for solving optimization problem. To design K-Means algorithm that portion nodes based on their proximities by optimize the distance between nodes within same cluster by assigning them to the closet cluster center. …”
    Get full text
    Get full text
    Conference or Workshop Item