Search Results - (( _ application ((tree algorithm) OR (bees algorithm)) ) OR ( its application usage algorithm ))*

Refine Results
  1. 1

    A class skew-insensitive ACO-based decision tree algorithm for imbalanced data sets by Mohd Razali, Muhamad Hasbullah, Saian, Rizauddin, Yap, Bee Wah, Ku-Mahamud, Ku Ruhana

    Published 2021
    “…Ant-tree-miner (ATM) has an advantage over the conventional decision tree algorithm in terms of feature selection. …”
    Get full text
    Get full text
    Get full text
    Article
  2. 2

    Improved tree routing protocol in zigbee networks by Al-Harbawi, Mostafa Kamil Abdulhusain

    Published 2010
    “…ImpTR protocol uses an approach to select next hope depending on new algorithm and uses the same tree topology construction for distributing address to all sensor nodes in the network. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Photogrammetric unmanned aerial vehicle for digital terrain model estimation under oil palm tree canopy area / Suzanah Abdullah by Abdullah, Suzanah

    Published 2021
    “…Following the application of a new methodology on the real site, the result indicated the consistency of DTM values of all the algorithms at different flying heights but there were relatively small differences between all the algorithms used. …”
    Get full text
    Get full text
    Thesis
  4. 4

    Task scheduling in cloud computing environment using hybrid genetic algorithm and bat algorithm by Muhammad Syahril Mohamad Sainal

    Published 2022
    “…Genetic algorithm was widely used because of its accuracy and simplicity. …”
    Get full text
    Get full text
    Get full text
    Academic Exercise
  5. 5

    Sentiment Analysis on Users' Satisfaction for Mobile Banking Apps in Malaysia by Misinem, ., Tri Basuki, Kurniawan, Mohd Zaki, Zakaria, Muhammad Aqil Azfar, Uzailee

    Published 2022
    “…The best accuracy result shows 94.37% by the Decision Tree algorithm, and Naïve Bayes obtained the worst outcome at 66%.…”
    Get full text
    Get full text
    Get full text
    Article
  6. 6
  7. 7
  8. 8

    Mining Sequential Patterns Using I-PrefixSpan by Dhany , Saputra, Rambli Dayang, R.A., Foong, Oi Mean

    Published 2007
    “…In this paper, we propose an improvement of pattern growth-based PrefixSpan algorithm, called I-PrefixSpan. The general idea of I-PrefixSpan is to use the efficient data structure for general tree-like framework and separator database to reduce the execution time and memory usage. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  9. 9
  10. 10
  11. 11
  12. 12

    Energy-aware task scheduling for streaming applications on NoC-based MPSoCs by Abd Ishak, Suhaimi Abd Ishak, Wu, Hui, Tariq, Umair Ullah

    Published 2024
    “…Our approach is supported by a set of novel techniques, which include constructing an initial schedule based on a list scheduling where the priority of each task is its approximate successor-tree-consistent deadline such that the workload across all the processors is balanced, a retiming heuristic to transform intraperiod dependencies into inter-period dependencies for enhancing parallelism, assigning an optimal discrete frequency for each task and each message using a Non-Linear Programming (NLP)-based algorithm and an Integer-Linear Programming (ILP)-based algorithm, and an incremental approach to reduce the memory usage of the retimed schedule in case of memory size violations. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13
  14. 14
  15. 15

    Using the bees algorithm to optimise a support vector machine for wood defect classification by Pham, D.T, Muhammad, Zaidi, Mahmuddin, Massudi, Ghanbarzadeh, Afshin, Koc, Ebubekir, Otri, Sameh

    Published 2007
    “…This paper describes a new application of the Bees Algorithm to the optimization of a Support Vector Machine (SVM) for the problem of classifying defects in plywood. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20