Search Results - (( basic generation extension algorithm ) OR ( java implementation path algorithm ))

  • Showing 1 - 14 results of 14
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
  6. 6

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

    Published 2011
    “…The reason is that, SRT algorithm is sensitive to the accuracy of the learned preferences while MGT algorithm can generate Pareto-optimal offers even with an approximation of the learned preferences.…”
    Get full text
    Get full text
    Thesis
  7. 7

    Design And Evaluation Of A Modified Csma/Cd Mac Protocol On Single-Channel Optical Local Area Network by Khairi, Kharina

    Published 2003
    “…The algorithm was developed in Visual Basic 6.0v programming language. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Optimal placement and sizing of distributed generators for voltage-dependent load model in radial distribution system by Mahesh, K., Nallagownden, P., Elamvazuthi, I.

    Published 2017
    “…The proposed study has been applied to the IEEE 33 radial distribution system with basic particle swarm optimization (PSO) algorithm. …”
    Get full text
    Get full text
    Article
  9. 9

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

    Query proof structure caching for incremental evaluation of tabled prolog programs / Taher Muhammad Ali by Taher Muhammad, Ali

    Published 2013
    “…JLOG is a sub-system integrated with PROLOG inference engine which supports incremental tabled extensions to PROLOG evaluation. The thesis presents the design, necessary data structures, algorithms and implementation details of JLOG. …”
    Get full text
    Get full text
    Get full text
    Thesis
  11. 11

    Optimization of Upstream Offshore Oilfield Production Planning under Uncertainty and Downstream Crude Oil Scheduling at Refinery Front-End by Tan Yin Keong, Tan Yin

    Published 2012
    “…In order to obtain a global optimum solution of the problem, an outer-approximation algorithm is proposed, whereby lower and upper bounds on the global optimum are generated, which are converged to a specified tolerance. …”
    Get full text
    Get full text
    Final Year Project
  12. 12

    One-dimension high-order compact method for solving euler's equation by Mohamad, Mahmod Abd Hakim bin

    Published 2010
    “…In the field of computational fluid dynamics, many numerical algorithms have been developed to simulate inviscid, compressible flows problems. …”
    Get full text
    Get full text
    Thesis
  13. 13

    Transcriptomic Study of Gracilaria Changii (Gracilariales, Rhodophyta) By Expressed Sequence Tags and Cdna Microarray Approach by Seddon, Teoh

    Published 2009
    “…The putative identity of TUGs was identified by using Basic Local Alignment Search Tool X (BLASTX) algorithm and classified according to the functional groups in Kyoto Encyclopedia of Genes and Genomes (KEGG). …”
    Get full text
    Get full text
    Thesis
  14. 14

    One-dimensional high-order compact method for solving Euler's equations by Mohamad, Mahmod Abd Hakim, Basri, Shahnor, Basuno, Bambang

    Published 2011
    “…In the field of computational fluid dynamics, many numerical algorithms have been developed to simulate inviscid, compressible flows problems. …”
    Get full text
    Get full text
    Conference or Workshop Item