Search Results - (( java implementation path algorithm ) OR ( knowledge selection method algorithm ))

Refine Results
  1. 1

    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer by Ahmad Nezer, Nurul Aqilah

    Published 2017
    “…The development tools used in developing this project is NetBeans by using Java for the implementation of the coding. The methodology that used for developing this system is the Dijkstra’s algorithm. …”
    Get full text
    Get full text
    Thesis
  2. 2

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

    Published 2019
    “…BST inserts the nodes in the way that the Dijkstra’s can find the empty parking in fastest way. Dijkstra’s algorithm initials the paths to finding the shortest path while ACO optimizes the paths. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment by Shaliza Hayati A. Wahab, Nordin Saad, Azali Saudi, Ali Chekima

    Published 2021
    “…In this study, a fast iterative method known as Rotated Successive Over-Relaxation (RSOR) is introduced. The algorithm is implemented in a self-developed 2D Java tool, UAV Planner. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  4. 4

    Smart appointment organizer for mobile application / Mohd Syafiq Adam by Adam, Mohd Syafiq

    Published 2009
    “…The main component of this prototype is the use of Dijkstra algorithm to compute the shortest path from source of appointment to the 6 points of destinations within UiTM Shah Alam. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Multiview Laplacian semisupervised feature selection by leveraging shared knowledge among multiple tasks by Krishnasamy, Ganesh, Paramesran, Raveendran

    Published 2019
    “…Experiment results on several multimedia applications have shown that the proposed algorithm is competitive compared with the other single-view feature selection algorithms.…”
    Get full text
    Get full text
    Article
  6. 6
  7. 7

    AGENT MEETING SCHEDULER by ZAINAL ABIDIN, NURAINI

    Published 2011
    “…An agent meeting scheduler prototype then will be developed to prove that the selected algorithm is working properly. Qualitative research method is being used to gather necessary data on agent algorithm and this data will be used to select the suitable algorithm. …”
    Get full text
    Get full text
    Final Year Project
  8. 8

    The Significant Effect of Feature Selection Methods in Spam Risk Assessment Using Dendritic Cell Algorithm by Zainal, K, Jali, MZ

    Published 2024
    “…This feature selection method then further fed in conjunction with the Dendritic Cell Algorithm (DCA) as the classifier to measure the risk concentration of a spam message. …”
    Proceedings Paper
  9. 9
  10. 10

    Towards a better feature subset selection approach by Shiba, Omar A. A.

    Published 2010
    “…The selection of the optimal features subset and the classification has become an important issue in the data mining field.We propose a feature selection scheme based on slicing technique which was originally proposed for programming languages.The proposed approach called Case Slicing Technique (CST).Slicing means that we are interested in automatically obtaining that portion 'features' of the case responsible for specific parts of the solution of the case at hand.We show that our goal should be to eliminate the number of features by removing irrelevant once.Choosing a subset of the features may increase accuracy and reduce complexity of the acquired knowledge.Our experimental results indicate that the performance of CST as a method of feature subset selection is better than the performance of the other approaches which are RELIEF with Base Learning Algorithm (C4.5), RELIEF with K-Nearest Neighbour (K-NN), RELIEF with Induction of Decision Tree Algorithm (ID3) and RELIEF with Naïve Bayes (NB), which are mostly used in the feature selection task.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  11. 11

    Efficient genetic partitioning-around-medoid algorithm for clustering by Garib, Sarmad Makki Mohammed

    Published 2019
    “…This study utilizes genetic algorithms based upon the medoid rather than the mean as a centroid-selection schema to improve the clustering efficiency. …”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13

    Feature Selection Based on Grey Wolf Optimizer for Oil Gas Reservoir Classification by Al-Tashi, Q., Rais, H.M., Abdulkadir, S.J., Mirjalili, S.

    Published 2020
    “…In this paper, a wrapper-based feature selection method is proposed to select the optimal feature subset. …”
    Get full text
    Get full text
    Conference or Workshop Item
  14. 14

    Kernel and multi-class classifiers for multi-floor wlan localisation by Abd Rahman, Mohd Amiruddin

    Published 2016
    “…For fingerprint database optimisation, novel access point (AP) selection algorithms which are based on variant AP selection are investigated to improve computational accuracy compared to existing AP selection algorithms such as Max-Mean and InfoGain. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Self organizing multi-objective optimization problem by Ismail, Fatimah Sham, Yusof, Rubiyah, Khalid, Marzuki

    Published 2011
    “…However, this approach has some limitations because of the difficulty in selecting an appropriate weight for each objective and the need of some knowledge about the problems. …”
    Get full text
    Get full text
    Article
  16. 16

    Numerical analysis by Butcher, John

    Published 2008
    “…Selecting a numerical method, or family of methods, and integrating the method or methods into a software package, deals with all these challenges and, of necessity, seeks compromises between them. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17

    Depth linear discrimination-oriented feature selection method based on adaptive sine cosine algorithm for software defect prediction by Nasser, Abdullah, H.M. Ghanem, Waheed Ali, H.Y. Saad, Abdul-Malik, Hamed Abdul-Qawy, Antar Shaddad, A. Ghaleb, Sanaa A, Mohammed Alduais, Nayef Abdulwahab, Din, Fakhrud, Ghetas, Mohamed

    Published 2024
    “…To address these challenges, this research introduces a novel Depth Linear Discrimination-Oriented Feature Selection Method based on Adaptive Sine Cosine Algorithm, named Depth Adaptive Sine Cosine Feature Selection (DASC-FS). …”
    Get full text
    Get full text
    Get full text
    Article
  18. 18
  19. 19

    Enhanced cell-based algorithm with dynamic radius in solving capacitated multi-source weber problem by Nurhazwani, Ahmad Razak

    Published 2021
    “…This research finds the location of facilities in a continuous space to meet the demand of customers which minimize the total cost using Enhanced Cell-based Algorithm (ECBA). This method was derived from previous study that divides the distribution of customers into smaller cells of promising locations. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Research on the construction of an efficient and lightweight online detection method for tiny surface defects through model compression and knowledge distillation by Chen, Qipeng, Xiong, Qiaoqiao, Huang, Haisong, Tang, Saihong, Liu, Zhenghong

    Published 2024
    “…The K-means++ clustering algorithm generates candidate bounding boxes, adapting to defects of different sizes and selecting finer features earlier. …”
    Get full text
    Get full text
    Article