Search Results - (( java simulation optimization algorithm ) OR ( based construction tree algorithm ))

Refine Results
  1. 1
  2. 2
  3. 3

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

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

    Published 2011
    “…The objective of this paper is to propose a new spatial decision tree algorithm based on the ID3 algorithm for discrete features represented in points, lines and polygons. …”
    Get full text
    Get full text
    Conference or Workshop Item
  5. 5

    Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

    Published 2011
    “…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources. A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

    Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

    Published 2012
    “…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
    Get full text
    Get full text
    Get full text
    Monograph
  7. 7
  8. 8

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

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

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

    Published 2010
    “…Our algorithm works based on prime factorization, and is called Frequent Pattern-Prime Factorization (FPPF).…”
    Get full text
    Get full text
    Conference or Workshop Item
  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
  14. 14

    A coalition model for efficient indexing in wireless sensor network with random mobility / Hazem Jihad Ali Badarneh by Hazem Jihad , Ali Badarneh

    Published 2021
    “…The second and third scenarios evaluate the performance of Coalition-Based Index-Tree by examining the effects of Dynamic-Coalition framework and Static-Coalition algorithm on Coalition-Based Index-Tree framework. …”
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15

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

    Amtree Protocol Enhancement by Multicast Tree Modification and Incorporation of Multiple Sources by Al‐Sharafi, Ali Mohammed Ali

    Published 2008
    “…It is separated into three phases: 1) construction of multicast tree. 2) Handoff process. 3) Optimization Process. …”
    Get full text
    Get full text
    Thesis
  17. 17

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

    OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

    Published 2023
    “…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”
    Review
  19. 19

    Prime-based method for interactive mining of frequent patterns by Nadimi-Shahraki, Mohammad-Hossein

    Published 2010
    “…The PC-tree is a well-organized tree structure, which is systematically built based on descendant making introduced in this study. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Parsing algorithms for grammars with regulated rewriting by Turaev, Sherzod, Othman, Mohamed, Selamat, Mohd Hasan, Krassovitskiy, Alexander

    Published 2011
    “…In this paper, we show that the parsing problem for regulated grammars can be solved by means of Petri net derivation trees constructed using the net unfolding. Moreover, we present a parsing algorithm for the deterministic restriction of Petri net controlled grammars based on the well-known Earley parsing algorithm.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper