Search Results - (( parameter satisfaction selection algorithm ) OR ( java implementation path 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

    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

    Multiple users replica selection in data grids for fair user satisfaction: A hybrid approach by Jaradat, A., Alhussian, H., Patel, A., Fati, S.M.

    Published 2020
    “…Replica selection in data grids aims to select the best replica location based on the quality-of-service parameters preferred by the user. …”
    Get full text
    Get full text
    Article
  6. 6

    Selection of access network using cost function method in heterogeneous wireless network by Mohamad Tahir, Hatim, Al-Ghushami, Abdullah Hussein, Yahya, Zainor Ridzuan

    Published 2014
    “…This method covers the weight distribution and cost factor techniques.The weight distribution is used to measure different weights for existing wireless network based on the user's preference and mobile terminal power.The cost factor technique is also used to identify the cost for performing handover target by considering every network parameters and its weight.Results obtained showed that the algorithm has the ability to increase user's satisfaction compared to other algorithms, which consistently choose one accessible network.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  7. 7
  8. 8

    Development of cell formation algorithm and model for cellular manufacturing system by Nouri, Hossein

    Published 2011
    “…It is consequence of the designers could not handle constraints satisfaction. Therefore, for this proposes good benchmarked algorithm, bacteria foraging algorithm is selected and developed to solve multiobjective cell formation model and traced constraints satisfaction handling to produce feasible optimal solution. …”
    Get full text
    Get full text
    Thesis
  9. 9

    Efficient vehicle routing optimization for autistic users / Abdulrahman Hasan Mohammed Shabalah by Abdulrahman Hasan , Mohammed Shabalah

    Published 2020
    “…The Simulation results were obtained by measuring the performance of three algorithms named Ant Colony, A Multiple Parameter control for Ant Colony (MPAC), and the proposed AFAC. …”
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10

    Multi agent quality of service routing based on scheme ant colony optimization algorithm by Baygi, Maassoumeh Javadi

    Published 2014
    “…Moreover, the proposed approach outperforms the WSP and SWP algorithms, where network efficiency in saturated load gains an 8.39% improvement while the satisfaction of delay and jitter constraints for time critical applications are also achieved. …”
    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