Search Results - (( java implementation path algorithm ) OR ( data visualisation new algorithm ))

Search alternatives:

  • Showing 1 - 12 results of 12
Refine Results
  1. 1
    Effectiveness of silhouette rendering algorithms in terrain visualisation

    Effectiveness of silhouette rendering algorithms in terrain visualisation by Che Mat, Ruzinoor, Visvalingam, Mahes

    Published 2002
    “…This approach has been implemented in a 3D modelling system to create a new method of displaying and viewing terrain data in an artistic style. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  2. 2
    Heavy Transportation Shortest Route using Dijkstra’s algorithm (HETRO) / Nurul Aqilah Ahmad Nezer

    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
    Save to List
    Saved in:
  3. 3
    Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization

    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
    Save to List
    Saved in:
  4. 4
    Path planning for unmanned aerial vehicle (UAV) using rotated accelerated method in static outdoor environment

    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
    Save to List
    Saved in:
  5. 5
    Smart appointment organizer for mobile application / Mohd Syafiq Adam

    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
    Save to List
    Saved in:
  6. 6
    Dynamic modeling by usage data for personalization systems

    Dynamic modeling by usage data for personalization systems by Aghabozorgi, S.R., Teh, Y.W.

    Published 2009
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  7. 7
    Detecting space-time disease clusters with arbitrary shapes and sizes using a co-clustering approach

    Detecting space-time disease clusters with arbitrary shapes and sizes using a co-clustering approach by Ullah, S., Daud, H., Dass, S.C., Khan, H.N., Khalil, A.

    Published 2017
    “…This method was utilised to detect potential clusters in the annual and monthly malaria data in Khyber Pakhtunkhwa Province, Pakistan from 2012 to 2016 visualising the results on a heat map. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Mining and integration of oral cancer genomics for predictive therapeutics / Bernard Lee Kok Bang

    Mining and integration of oral cancer genomics for predictive therapeutics / Bernard Lee Kok Bang by Bernard Lee, Kok Bang

    Published 2019
    “…Technical evaluation of performance reliability of six gene signature similarity scoring algorithms showed that the Weighted Connectivity Score or the statistically significant Connectivity Map, are prime candidates for upgrading the current core algorithm of DeSigN, which is based on the Kolmogorov-Smirnov statistic. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Evolutionary cost-cognizant regression test case prioritization for object-oriented programs

    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
    Save to List
    Saved in:
  10. 10
    Feature extraction and localisation using scale-invariant feature transform on 2.5D image

    Feature extraction and localisation using scale-invariant feature transform on 2.5D image by Suk, Ting Pui, Jacey-Lynn, Minoi, Terrin, Lim, Fradinho Oliveira, João, Fyfe Gillies, Duncan

    Published 2015
    “…In this paper, we present and discuss our new automatic landmarking method on face data using 2.5-dimensional (2.5D) range images. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    Urban green space spatio-temporal change influences on land surface temperature in Kuala Lumpur, Malaysia

    Urban green space spatio-temporal change influences on land surface temperature in Kuala Lumpur, Malaysia by Abu Kasim, Junainah

    Published 2020
    “…The broad range of output generated from the multiple temporal of high-resolution aerial imagery could henceforth improve the reliability of collected data and develop a high-performance outcome in interpreting real visualised scenarios.…”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    Modified dynamic programming model with limited order picking capacity / Noraimi Azlin Mohd Nordin

    Modified dynamic programming model with limited order picking capacity / Noraimi Azlin Mohd Nordin by Noraimi Azlin , Mohd Nordin

    Published 2021
    “…Fourthly is to test and compare the developed mathematical order picking model with secondary data and finally to simulate the data into three types of categories; small, medium and large. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: