Search Results - (( based k based algorithm ) OR ( java application optimization algorithm ))

Refine Results
  1. 1
  2. 2
  3. 3

    Performance evaluation of real-time multiprocessor scheduling algorithms by Alhussian, H., Zakaria, N., Abdulkadir, S.J., Fageeri, S.O.

    Published 2016
    “…These results suggests that optimal algorithms may turn to be non-optimal when practically implemented, unlike USG which reveals far less scheduling overhead and hence could be practically implemented in real-world applications. …”
    Get full text
    Get full text
    Conference or Workshop Item
  4. 4

    Route Optimization System by Zulkifli, Abdul Hayy

    Published 2005
    “…After much research into the many algorithms available, and considering some, including Genetic Algorithm (GA), the author selected Dijkstra's Algorithm (DA). …”
    Get full text
    Get full text
    Final Year Project
  5. 5
  6. 6
  7. 7
  8. 8
  9. 9

    Computer Lab Timetabling Using Genetic Algorithm Case Study - Unit ICT by Abdullah, Amran

    Published 2006
    “…Genetic Algorithm is one of the most popular optimization solutions used in various applications such as scheduling. …”
    Get full text
    Get full text
    Thesis
  10. 10
  11. 11

    Efficient genetic partitioning-around-medoid algorithm for clustering by Garib, Sarmad Makki Mohammed

    Published 2019
    “…However, the complexity of the kmedoid based algorithms in general is more than the complexity of the k-means based algorithms. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Centre-based hard clustering algorithms for Y-STR data / Ali Seman, Zainab Abu Bakar and Azizian Mohd. Sapawi by Seman, Ali, Abu Bakar, Zainab, Mohd. Sapawi, Azizian

    Published 2010
    “…The k-Means and the k-Modes algorithms are the fundamental algorithms for the centroid-based partitioning technique, whereas the k-Medoids is a representative object-based partitioning technique. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

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

    Examination timetabling using genetic algorithm case study: KUiTTHO by Mohd Salikon, Mohd Zaki

    Published 2005
    “…Genetic Algorithm (GA) is one of the most popular optimization solutions. …”
    Get full text
    Get full text
    Thesis
  15. 15

    The performance of k-means clustering method based on robust principal components by Kadom, Ahmed, Midi, Habshah, Rana, Sohel

    Published 2018
    “…To remedy this problem, we proposed to integrate robust principal component analysis (RPCA) with the k-means algorithm. Simulation study and real examples are carried out to compare the performance of the classical k-means, k-means based on PCA and k-means based on RPCA. …”
    Get full text
    Get full text
    Article
  16. 16
  17. 17

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

    Published 2004
    “…CST was compared to other selected classification methods based on feature subset selection such as Induction of Decision Tree Algorithm (ID3), Base Learning Algorithm K-Nearest Nighbour Algorithm (k-NN) and NaYve Bay~sA lgorithm (NB). …”
    Get full text
    Get full text
    Thesis
  18. 18

    Cluster Analysis of Data Points using Partitioning and Probabilistic Model-based Algorithms by Raheem, Ajiboye Adeleke, Hauwau, Isah-Kebbe, O., Oladele Tinuke

    Published 2014
    “…This study explores the performance accuracies of partitioning-based algorithms and probabilistic model-based algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  19. 19
  20. 20

    A Patent Technique of Jaccard Discrete (J-DIS) Similarity Clustering Algorithm by Imtiaz, Sharjeel, Saadiah, Yahya

    Published 2014
    “…Mostly, k-Means algorithm finds out similarity between the object based on distance vector for smallest dataset. …”
    Get full text
    Get full text
    Journal