Search Results - (( java application optimization algorithm ) OR ( _ constructability tree algorithm ))

Refine Results
  1. 1
  2. 2

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

    A Scalable Algorithm for Constructing Frequent Pattern Tree by Noraziah, Ahmad, Herawan, Tutut, Zailani, Abdullah, Mustafa, Mat Deris

    Published 2014
    “…The construction of FP-Tree is very important prior to frequent patterns mining. …”
    Get full text
    Get full text
    Get full text
    Article
  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

    Hyper-Heuristic Evolutionary Approach for Constructing Decision Tree Classifiers by Kumar, Sunil, Ratnoo, Saroj, Vashishtha, Jyoti

    Published 2021
    “…Finding optimal values for the hyper parameters of a decision tree construction algorithm is a challenging issue. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  6. 6
  7. 7

    A comparative analysis of Prim, Kruskal, and Reverse-Delete algorithms in optimizing routes within Terengganu’s and Pahang’s attraction road network / Munashahira Mohammad Zahid... by Mohammad Zahid, Munashahira

    Published 2024
    “…The goal is to determine the most effective algorithm for constructing the minimum spanning tree (MST) that minimizes total travel distance. …”
    Get full text
    Get full text
    Thesis
  8. 8
  9. 9

    An extended ID3 decision tree algorithm for spatial data by Sitanggang, Imas Sukaesih, Yaakob, Razali, Mustapha, Norwati, Nuruddin, Ahmad Ainuddin

    Published 2011
    “…Empirical result demonstrates that the proposed algorithm can be used to join two spatial objects in constructing spatial decision trees on small spatial dataset. …”
    Get full text
    Get full text
    Conference or Workshop Item
  10. 10
  11. 11
  12. 12

    Classification model for hotspot occurrences using spatial decision tree algorithm by Sitanggang, Imas Sukaesih, Yaakob, Razali, Mustapha, Norwati, Nuruddin, Ahmad Ainuddin

    Published 2013
    “…Empirical result demonstrates that the proposed algorithm can be used to join two spatial objects in constructing a spatial decision tree from a spatial dataset. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    A data mining approach to construct graduates employability model in Malaysia by Sapaat, Myzatul Akmam, Mustapha, Aida, Ahmad, Johanna, Chamili, Khadijah, Muhamad, Rahamirzam

    Published 2011
    “…The performance of Bayes algorithms are also compared against a number of tree-based algorithms. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

    Constructing routing tree for centralized scheduling using multi-channel single transceiver system in 802.16 mesh mode by Al-Hemyari, Ali, Ng, Chee Kyun, Noordin, Nor Kamariah, Ismail, Alyani, Khatun, Sabira

    Published 2008
    “…This paper proposes a centralized scheduling algorithm that can reduce interferences by constructing routing tree with multi-channel single transceiver system in WiMAX mesh networks. …”
    Get full text
    Get full text
    Conference or Workshop Item
  15. 15
  16. 16
  17. 17

    The stopping rules for winsorized tree by Chee, Keong Ch’ng, Mahat, Nor Idayu

    Published 2017
    “…Winsorized tree is a modified tree-based classifier that is able to investigate and to handle all outliers in all nodes along the process of constructing the tree.It overcomes the tedious process of constructing a classical tree where the splitting of branches and pruning go concurrently so that the constructed tree would not grow bushy. …”
    Get full text
    Get full text
    Conference or Workshop Item
  18. 18
  19. 19

    Constructing routing tree centralized scheduling using multi-channel system in 802.16 by Al-Hemyari, Ali, Ng, Chee Kyun, Noordin, Nor Kamariah, Ismail, Alyani, Khatun, Sabira

    Published 2008
    “…This paper proposes a centralized scheduling algorithm by constructing routing tree in WiMax mesh network, which introduces the cross-layer concept between the media access controller (MAC) and the network layers. …”
    Get full text
    Get full text
    Conference or Workshop Item
  20. 20

    A frequent pattern mining algorithm based on FP-growth without generating tree by Tohid, Hossein, Ibrahim, Hamidah

    Published 2010
    “…It then divides the compressed database into a set of conditional databases (a special kind of projected database), each associated with one frequent item or pattern fragment, and mines each such database separately.For a large database, constructing a large tree in the memory is a time consuming task and increase the time of execution.In this paper we introduce an algorithm to generate frequent patterns without generating a tree and therefore improve the time complexity and memory complexity as well.Our algorithm works based on prime factorization, and is called Frequent Pattern- Prime Factorization (FPPF).…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item