Search Results - (( java implementation path algorithm ) OR ( based election problems algorithm ))

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

    Effect of negative campaign strategy of election algorithm in solving optimization problem by Hamza Abubakar, Saratha Sathasivam, Shehab Abdulhabib Alzaeemi

    Published 2020
    “…Election algorithm (EA) is an optimization technique based on minimization and coalition operations to solve competition among neurons. …”
    Get full text
    Get full text
    Get full text
    Article
  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

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

    Local search heuristics for elective surgery scheduling considering patient urgency by Rashid, N. S. A., Rahmin, N. A. A., Leong, W. J., Mohamed Ali, Nazihah

    Published 2019
    “…An integer linear programming model is referred to solve the problem. As the model consume a high computational time to solve for a large-scale instance, we developed a local search algorithm based on a simple heuristic to deal with the problem. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7

    An efficient up-link load reduction model based on clustering in vanets by Abbas Al-Sallami, Ali Hashim

    Published 2019
    “…EULR model consisted of three parts: the first part, two novel algorithms Smart CH Election (SCHE) and Hybrid Cluster-Head Election (HCHE) to increase cluster stability and reduce the number of CHs changes in the network by selecting the best vehicle as cluster head (CH) based on two dynamic thresholds. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  8. 8

    Unequal clustering in wireless sensor network: A review by Al-Ani K.W., Abdullah F.B., Yossuf S.

    Published 2023
    “…The comparison between the various mechanisms was based on cluster head election process, cluster properties, simulation parameters and energy efficiency to highlight a more efficient and scalable unequal clustering algorithm for WSN. � 2021 Institute of Advanced Engineering and Science. …”
    Article
  9. 9
  10. 10

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

    Semantic-Based, Scalable, Decentralized and Dynamic Resource Discovery for Internet-Based Distributed System by Hassan, Mahamat. I, Azween, Abdullah

    Published 2010
    “…DA describes the service capabilities based on the ontology, and RA carries the service requests based on the ontology as well. …”
    Get full text
    Get full text
    Thesis
  12. 12

    Semantic-Based, Scalable, Decentralized and Dynamic Resource Discovery for Internet-Based Distributed System by HASSAN, MAHAMAT ISSA

    Published 2010
    “…DA describes the service capabilities based on the ontology, and RA I carries the service requests based on the ontology as well. …”
    Get full text
    Get full text
    Thesis
  13. 13

    Public healthcare facility planning in Malaysia : Using location allocation models / S. Sarifah Radiah Shariff by S. Sarifah Radiah, Shariff

    Published 2012
    “…Two basic location allocation models with two different objectives are studied: The p-median problem and the Maximal Covering Location Problem (MCLP). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis