Search Results - (( java implementation path algorithm ) OR ( program optimization mining algorithm ))

  • Showing 1 - 15 results of 15
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
  3. 3

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

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

    Data mining using genetic algorithm in finance data / A. Noor Latiffah and A. B. Nordin by Latiffah, A. Noor, Nordin, A. B.

    Published 2006
    “…The methods that wilt be applied are conventional statistical methods Markowitz Optimization as well as evolutionary programming (EP) utilizing genetic algorithms. …”
    Get full text
    Get full text
    Conference or Workshop Item
  6. 6

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

    Long-term electrical energy consumption: Formulating and forecasting via optimized gene expression programming / Seyed Hamidreza Aghay Kaboli by Seyed Hamidreza , Aghay Kaboli

    Published 2018
    “…To assess the applicability and accuracy of the proposed method for long-term electrical energy consumption, its estimates are compared with those obtained from artificial neural network (ANN), support vector regression (SVR), adaptive neuro-fuzzy inference system (ANFIS), rule-based data mining algorithm, GEP, linear, quadratic and exponential models optimized by particle swarm optimization (PSO), cuckoo search algorithm (CSA), artificial cooperative search (ACS) algorithm and backtracking search algorithm (BSA). …”
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9

    Uncovering patterns in online database usage at UiTM Negeri Sembilan: a data mining approach/ Mohd Aizat Abd Halim and Safawi Abdul Rahman by Abd Halim, Mohd Aizat, Abdul Rahman, Safawi

    Published 2024
    “…This study investigates online database usage patterns at Universiti Teknologi MARA (UiTM) Negeri Sembilan through a data mining approach, specifically utilizing association rule mining and the Apriori algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
  10. 10
  11. 11

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

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

    Dynamic investment model for the restructed power market in the presence of wind source by Esfahani, Mohammad Tolou Askari Sedehi

    Published 2014
    “…In the third step, the long term optimal investment strategies of the hybrid wind-thermal investor are determined based on the dynamic programming algorithm by considering the long term states of demand growth and fuel price uncertainties. …”
    Get full text
    Get full text
    Thesis
  15. 15