Search Results - (( java implication force algorithm ) OR ( structure implementation tree algorithm ))

Search alternatives:

Refine Results
  1. 1
    Selection, generation and extraction of MCCTree using XMCCTree

    Selection, generation and extraction of MCCTree using XMCCTree by Sazaly, Ummu Sulaim, Selamat, Mohd Hasan, Baharom, Salmi, A. Jabar, Marzanah

    Published 2012
    “…The algorithms transform the XML tree into a compact global tree called CGTree, and select the MCCTree from the CGTree. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    A quantum algorithm for minimal spanning tree

    A quantum algorithm for minimal spanning tree by Aghaei, Mohammad Reza Soltan, Ahmad Zukarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin

    Published 2008
    “…Finally, we represent the result of implementing and simulating Primpsilas algorithm in the probabilistic quantum-classical algorithm.…”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  3. 3
    Performance evaluation of inverted files, B-Tree and B+ Tree indexing algorithm on Malay text / Suhanah Rosnan

    Performance evaluation of inverted files, B-Tree and B+ Tree indexing algorithm on Malay text / Suhanah Rosnan by Rosnan, Suhanah

    Published 2016
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    Enhance efficiency of answering XML keyword query using incompact structure of MCCTree

    Enhance efficiency of answering XML keyword query using incompact structure of MCCTree by Sazaly, Ummu Sulaim

    Published 2012
    “…Those processes constructed MCCTreeGenerator algorithm which will produce the same subtree as MCCTree but difference in its structure. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    A hybrid algorithm for finding shortest path in network routing.

    A hybrid algorithm for finding shortest path in network routing. by Soltan Aghaei, Mohammad Reza, Ahmad Zulkarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin

    Published 2009
    “…Finally, we represent the result of implementing and simulating Dijkstra's algorithm as the probabilistic quantum-classical algorithm.…”
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Disparity map algorithm using hierarchical of bitwise pixel differences and segment-tree from stereo image

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

    Published 2024
    “…Combining attributes from both, the semi-global method introduces more complex structure and high computational complexity. 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
    Save to List
    Saved in:
  7. 7
    The effectiveness of bottom up technique with probabilistic approach for a Malay parser

    The effectiveness of bottom up technique with probabilistic approach for a Malay parser by Muhammad Azhar Fairuzz Hiloh, Mohd Juzaiddin Ab Aziz, Lailatul Qadri Zakaria

    Published 2018
    “…The bottom up parsing will be supported by implementing Cocke–Younger–Kasami (CYK) algorithm. The parser’s performance is evaluated based on its effectiveness to overcome ambiguity by suggesting a more precise parse tree. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Crown counting and mapping of missing oil palm tree using airborne imaging system

    Crown counting and mapping of missing oil palm tree using airborne imaging system by Kee, Ya Wern

    Published 2019
    “…A graphical user interface by using MATLAB language was created based on the best executed method to aid users in counting the trees automatically. This helps to facilitate semi-skillful users to implement the tree counting algorithms. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    An Integrated Principal Component Analysis And Weighted Apriori-T Algorithm For Imbalanced Data Root Cause Analysis

    An Integrated Principal Component Analysis And Weighted Apriori-T Algorithm For Imbalanced Data Root Cause Analysis by Ong, Phaik Ling

    Published 2016
    “…In conclusion, the proposed algorithm is able to overcome the rare item issue by implementing covariance based support value normalization and high computational costs issue by implementing indexing enumeration tree structure.Future work of this study should focus on rule interpretation to generate more human understandable rule by novice in data mining. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Robotic path planning using rapidly-exploring random trees

    Robotic path planning using rapidly-exploring random trees by Sherwani, Fahad

    Published 2013
    “…This study concerns the implementation of Rapidly-Exploring Random Trees (RRTs) algorithm for an autonomous robot path planning. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Car dealership web application

    Car dealership web application by Yap, Jheng Khin

    Published 2022
    “…The transfer learning algorithm pre-trained the River adaptive random forest regressor and classifier by transferring the tree structures and weights from the Scikit-learn fitted random forest regressor and classifier, respectively. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  12. 12
    Dynamic scene occlusion culling in architectural scenes based on dynamic bounding volume

    Dynamic scene occlusion culling in architectural scenes based on dynamic bounding volume by Paunoo @ Balu, Baldeve

    Published 2006
    “…In this thesis, the aim of the research carried out, is to handle dynamic objects efficiently with faster frame rate display. This algorithm is implemented using portal occlusion culling and kD-tree, which is suitable for indoor and architectural scenes. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Comparing the knowledge quality in rough classifier and decision tree classifier

    Comparing the knowledge quality in rough classifier and decision tree classifier by Mohamad Mohsin, Mohamad Farhan, Abd Wahab, Mohd Helmy

    Published 2008
    “…This paper presents a comparative study of two rule based classifier; rough set (Rc) and decision tree (DTc).Both techniques apply different approach to perform classification but produce same structure of output with comparable result. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  14. 14
    Data mining for structural damage identification using hybrid artificial neural network based algorithm for beam and slab girder / Meisam Gordan

    Data mining for structural damage identification using hybrid artificial neural network based algorithm for beam and slab girder / Meisam Gordan by Meisam , Gordan

    Published 2020
    “…After evaluating the results of these algorithms, a hybrid Artificial Neural Network-based Imperial Competitive Algorithm (ANN-ICA) was presented in the deployment step of the proposed methodology to identify the structural damage of illustrative structures. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Modeling of static and dynamic components of bio-nanorobotic systems

    Modeling of static and dynamic components of bio-nanorobotic systems by Gavgani, Hamidreza Khataee

    Published 2012
    “…The first modeling technique applies graph algorithms to compute a new set of optimal weighted structural properties of C60 and C70 fullerenes. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    A study on component-based technology for development of complex bioinformatics software

    A study on component-based technology for development of complex bioinformatics software by Ali Shah, Zuraini, Deris, Safaai, Othman, Muhamad Razib, Zakaria, Zalmiyah, Saad, Puteh, Hassan, Rohayanti, Muda, Mohd. Hilmi, Kasim, Shahreen, Roslan, Rosfuzah

    Published 2004
    “…From the enriched GO tree, the BTreeBicluster algorithm is applied during the clustering process. …”
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  17. 17
    Poverty risk prediction based on socioeconomic factors using machine learning approach

    Poverty risk prediction based on socioeconomic factors using machine learning approach by Mohd Zawari, Nur Farhana Adibah

    Published 2025
    “…Information gain was used in the feature selection and four classification algorithms namely, Logistic Regression, Random Forest, Decision Tree, and Gradient Boosted, were implemented and tested with the incorporation of 10-fold cross-validation and splitting 70:30 in WEKA. …”
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  18. 18
    Support Vector Machines (SVM) in Test Extraction

    Support Vector Machines (SVM) in Test Extraction by Ghazali, Nadirah

    Published 2006
    “…There exist numerous algorithms to address the need of text categorization including Naive Bayes, k-nearest-neighbor classifier, and decision trees. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  19. 19
    Support Vector Machines (SVM) in Test Extraction

    Support Vector Machines (SVM) in Test Extraction by Ghazali, Nadirah

    Published 2006
    “…There exist numerous algorithms to address the need of text categorization including Naive Bayes, k-nearest-neighbor classifier, and decision trees. …”
    Get full text
    Get full text
    Final Year Project
    Save to List
    Saved in:
  20. 20
    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization

    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

    Published 2019
    “…This study proposes a car parking management system which applies Dijkstra’s algorithm, Ant Colony Optimization (ACO) and Binary Search Tree (BST) in structuring a guidance system for indoor parking. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: