Search Results - (( quality solution mining algorithm ) OR ( java implementation path algorithm ))

  • Showing 1 - 18 results of 18
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

    A modified π rough k-means algorithm for web page recommendation system by Zidane, Khaled Ali Othman

    Published 2018
    “…However, the quality of current solutions has only managed to achieve accuracy within the range of 60-70%. …”
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6
  7. 7

    A hybrid local search algorithm for minimum dominating set problems by Abed, S.A., Rais, H.M., Watada, J., Sabar, N.R.

    Published 2022
    “…This algorithm focuses on generating promising solutions in different areas of the solution space using the problem search history. …”
    Get full text
    Get full text
    Article
  8. 8

    A hybrid local search algorithm for minimum dominating set problems by Abed, S.A., Rais, H.M., Watada, J., Sabar, N.R.

    Published 2022
    “…This algorithm focuses on generating promising solutions in different areas of the solution space using the problem search history. …”
    Get full text
    Get full text
    Article
  9. 9
  10. 10

    An artificial immune system model as talent performance predictor / Siti ‘Aisyah Sa’dan, Hamidah Jantan and Mohd Hanapi Abdul Latif by Sa’dan, Siti ‘Aisyah, Jantan, Hamidah, Abdul Latif, Mohd Hanapi

    Published 2016
    “…Immune based algorithm is part of bio-inspired algorithms elicits theories which can act as an inspiration for computer-based solutions. …”
    Get full text
    Get full text
    Research Reports
  11. 11

    Seed disperser ant algorithm for optimization / Chang Wen Liang by Chang , Wen Liang

    Published 2018
    “…The optimal results obtained for constrained engineering problems as well as data clustering are very promising in terms of quality of solutions and convergence speed of the algorithm.…”
    Get full text
    Get full text
    Get full text
    Thesis
  12. 12

    Hybrid metaheuristics for QOS-aware service composition / Hadi Naghavipour by Hadi , Naghavipour

    Published 2022
    “…Although metaheuristics have fulfilled some expectations, the quest for finding a high-quality, near-optimal solution has led researchers to devise hybrid methods. …”
    Get full text
    Get full text
    Get full text
    Thesis
  13. 13
  14. 14
  15. 15
  16. 16

    A comparative study between rough and decision tree classifiers by Mohamad Mohsin, Mohamad Farhan

    Published 2008
    “…Theoretically, a good set of knowledge should provide good accuracy when dealing with new cases.Besides accuracy, a good rule set must also has a minimum number of rules and each rule should be short as possible.It is often that a rule set contains smaller quantity of rules but they usually have more conditions.An ideal model should be able to produces fewer, shorter rule and classify new data with good accuracy.Consequently, the quality and compact knowledge will contribute manager with a good decision model.Because of that, the search for appropriate data mining approach which can provide quality knowledge is important.Rough classifier (RC) and decision tree classifier (DTC) are categorized as RBC.The purpose of this study is to investigate the capability of RC and DTC in generating quality knowledge which leads to the good accuracy.To achieve that, both classifiers are compared based on four measurements that are accuracy of the classification, the number of rule, the length of rule, and the coverage of rule.Five dataset from UCI Machine Learning namely United States Congressional Voting Records, Credit Approval, Wisconsin Diagnostic Breast Cancer, Pima Indians Diabetes Database, and Vehicle Silhouettes are chosen as data experiment.All datasets were mined using RC toolkit namely ROSETTA while C4.5 algorithm in WEKA application was chosen as DTC rule generator.The experimental results indicated that both classifiers produced good classification result and had generated quality rule in different types of model – higher accuracy, fewer rule, shorter rule, and higher coverage.In term of accuracy, RC obtained higher accuracy in average while DTC significantly generated lower number of rule than RC.In term of rule length, RC produced compact and shorter rule than DTC and the length is not significantly different.Meanwhile, RC has better coverage than DTC.Final conclusion can be decided as follows “If the user interested at a variety of rule pattern with a good accuracy and the number of rule is not important, RC is the best solution whereas if the user looks for fewer nr, DTC might be the best choice”…”
    Get full text
    Get full text
    Get full text
    Get full text
    Monograph
  17. 17

    Problem restructuring in interger programming for reduct searching by Ungku Chulan, Ungku Azmi Iskandar

    Published 2003
    “…The consumption of time and space were minimized quite significantly. Furthermore, the quality of the solutions was also successfully maintained. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Evolutionary cost-cognizant regression test case prioritization for object-oriented programs by Bello, AbdulKarim

    Published 2019
    “…Therefore, this study proposed a cost-cognizant TCP approach for object-oriented software that uses path-based integration testing to identify the possible execution path extracted from the Java System Dependence Graph (JSDG) model of the source code using forward slicing technique. …”
    Get full text
    Get full text
    Thesis