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

Refine Results
  1. 1
  2. 2

    A lower complexity k best algorithm for multiple input and multiple output detection by Jabir, Amjad N., Sabira, Khatun, Noordin, N. K., Ali, B. M.

    Published 2011
    “…This low complexity algorithm is based on probabilistic approach of sphere decoding with self adjustable capability depending on the levels (root, branch, leaf etc.) of a tree. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  3. 3

    A lower complexity K best algorithm for multiple input and multiple output detection by Jabir, Amjad Najim, Khatun, Sabira, Noordin, Nor Kamariah, Mohd Ali, Borhanuddin

    Published 2011
    “…This low complexity algorithm is based on probabilistic approach of sphere decoding with self adjustable capability depending on the levels (root, branch, leaf etc.) of a tree. …”
    Get full text
    Get full text
    Get full text
    Article
  4. 4

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

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

    Published 2010
    “…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. …”
    Get full text
    Get full text
    Conference or Workshop Item
  6. 6

    Disparity map algorithm using hierarchical of bitwise pixel differences and segment-tree from stereo image by Zainal Azali, Muhammad Nazmi

    Published 2024
    “…This thesis presents a local-based stereo matching algorithm to increase the accuracy on complex regions. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7
  8. 8
  9. 9

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

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

    E2IDS: an enhanced intelligent intrusion detection system based on decision tree algorithm by Bouke, Mohamed Aly, Abdullah, Azizol, ALshatebi, Sameer Hamoud, Abdullah, Mohd Taufik

    Published 2022
    “…The model design is Decision Tree (DT) algorithm-based, with an approach to data balancing since the data set used is highly unbalanced and one more approach for feature selection. …”
    Get full text
    Get full text
    Article
  13. 13

    Adaptive rapidly-exploring-random-tree-star (Rrt*) -Smart: algorithm characteristics and behavior analysis in complex environments by Jauwairia Nasir, Fahad Islam, Yasar Ayaz

    Published 2013
    “…Rapidly Exploring Random Trees (RRT) are regarded as one of the most efficient tools for planning feasible paths for mobile robots in complex obstacle cluttered environments. …”
    Get full text
    Get full text
    Get full text
    Article
  14. 14

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

    An algorithm for the selection of planting lining technique towards optimizing land area: an algorithm for planting lining technique selection by Md Badarudin, Ismadi, Md Sultan, Abu Bakar, Sulaiman, Md. Nasir, Mamat, Ali, Tengku Muda Mohamed, Mahmud

    Published 2012
    “…The algorithm is designed based on two basic works in which to calculate number of trees and divide an area into blocks. …”
    Get full text
    Get full text
    Conference or Workshop Item
  16. 16

    Using unique-prime-factorization theorem to mine frequent patterns without generating tree by Tohidi, Hossein, Ibrahim, Hamidah

    Published 2011
    “…In this study we introduce an algorithm to generate frequent patterns without generating a tree and therefore improve the time complexity and memory complexity as well. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17
  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

    Decision tree and rule-based classification for predicting online purchase behavior in Malaysia / Maslina Abdul Aziz, Nurul Ain Mustakim and Shuzlina Abdul Rahman by Abdul Aziz, Maslina, Mustakim, Nurul Ain, Abdul Rahman, Shuzlina

    Published 2024
    “…The result indicated that the highest accuracy of 89.34% was achieved by the Random Tree algorithm, while the rule-based algorithm PART reached an accuracy of 87.56%. …”
    Get full text
    Get full text
    Article
  20. 20

    Optimizing tree planting areas through integer programming and improved genetic algorithm by Md Badarudin, Ismadi

    Published 2012
    “…In conclusion, the hybrid algorithm based solution strategies improved efficiency with convincing results, therefore, this will assist planners for better decision making to optimize area to achieve more trees to be planted. …”
    Get full text
    Get full text
    Thesis