Search Results - (( java implementation path algorithm ) OR ( basic using greedy algorithm ))

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

    Automated bilateral negotiation with incomplete information in the e-marketplace. by Jazayeriy, Hamid

    Published 2011
    “…The MGT algorithm is useful to explore the properties of the Pareto-optimal offers. …”
    Get full text
    Get full text
    Thesis
  5. 5

    Nearest greedy for solving the waste collection vehicle routing problem: A case study by Mat, Nur Azriati, Benjamin, Aida Mauziah, Abdul-Rahman, Syariza, Wibowo, Antoni

    Published 2017
    “…This paper presents a real case study pertaining to an issue related to waste collection in the northern part of Malaysia by using a constructive heuristic algorithm known as the Nearest Greedy (NG) technique. …”
    Get full text
    Get full text
    Article
  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

    Heuristic resource allocation algorithm for controller placement in multi-control 5G based on SDN/NFV architecture by Ibrahim, Abeer Abdalla Zakaria, Hashim, Fazirulhisyam, Noordin, Nor Kamariah, Sali, Aduwati, Navaie, Keivan, Fadul, Saber Mohammed Elnour

    Published 2021
    “…It is based on the K-center problem, to solve the capacitated controller placement problem (CCPP), which acts as a resource location problem, in which the location and number of controllers can be allocated to maximize resources. A Greedy Randomized Search (GRS) algorithm was used to solve the dynamic assignment of nodes to controllers to achieve load balancing. …”
    Get full text
    Get full text
    Get full text
    Article
  8. 8

    UiTM Transportation Unit bus trip scheduling system / Noorzawanah Ab Rahim by Ab Rahim, Noorzawanah

    Published 2009
    “…The user interface application has been developed by using Microsoft visual basic 6.0 and Microsoft access as it's database. …”
    Get full text
    Get full text
    Thesis
  9. 9

    A Survey Of Supervised Machine Learning In Wireless Sensor Network: A Power Management Perspective by Ul haq, Riaz, Norrozila, Sulaiman, Muhammad, Alam

    Published 2013
    “…In the recent era, researchers used different routing algorithms to decrease the power consumption in order to increase the wireless sensor network life. …”
    Get full text
    Get full text
    Conference or Workshop Item
  10. 10

    A phonetically rich and balanced lexical corpus using zipfian distribution for an under resourced language / Aminath Farshana by Aminath , Farshana

    Published 2018
    “…The performance of the proposed method was also evaluated by comparing the results with an existing benchmark method (greedy algorithm). The results show that the sentences selected using proposed method cover all the phonetic units and is 14 times smaller than the corpus developed using the benchmark method. …”
    Get full text
    Get full text
    Get full text
    Thesis
  11. 11

    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