Search Results - (( java implementation path algorithm ) OR ( based computing window algorithm ))

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
  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
  7. 7
  8. 8
  9. 9

    Efficient management of Top-k queries over Uncertain Data Streams with dynamic Sliding Window Model by Raja Wahab, Raja Azhan Syah

    Published 2024
    “…Current research on tackling uncertainty revolves around creating specifically tailored algorithms that can operate in the presence of value uncertainty using both a count-based and a time-based approach. …”
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10
  11. 11

    Towards lowering computational power in IoT systems: Clustering algorithm for high-dimensional data stream using entropy window reduction by Alkawsi G., Al-amri R., Baashar Y., Ghorashi S., Alabdulkreem E., Kiong Tiong S.

    Published 2024
    “…Lately, a fully online buffer-based clustering algorithm for handling evolving data streams (BOCEDS) was developed. …”
    Article
  12. 12
  13. 13

    Removal of high density salt and pepper noise from image and video based on optimal decision based algorithm by Khammar, Mohammad Reza, Saripan, M. Iqbal, Marhaban, Mohammad Hamiruce, Ishak, Asnor Juraiza

    Published 2014
    “…Detection is provided by using statistical analysis in each window, then the appropriate replacement for the noisy pixel is conducted from given values inside the current window or adjacent reconstructed pixels based on mean calculation and also, for very high density of noise which density of noise is bigger than 80%, the reconstruction is based on a recursive approach. …”
    Get full text
    Get full text
    Conference or Workshop Item
  14. 14
  15. 15

    Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities by Benjamin, Aida Mauziah, Beasley, J. E.

    Published 2010
    “…We also have a driver rest period.The problem is solved heuristically.A neighbour set is defined for each customer as the set of customers that are close, but with compatible time windows. A procedure that attempts to fully utilise a vehicle is used to obtain an initial solution, with this initial solution being improved using an interchange procedure.We present two metaheuristic algorithms using tabu search and variable neighbourhood search that are based around the neighbour sets.We also present a metaheuristic based on variable neighbourhood tabu search, where the variable neighbourhood is searched via tabu search.Computational results are presented for publicly available waste collection problems involving up to 2092 customers and 19 waste disposal facilities, which indicate that our algorithms produce better quality solutions than previous work presented in the literature.…”
    Get full text
    Get full text
    Get full text
    Article
  16. 16
  17. 17
  18. 18

    Development Of Stereo-Matching Algorithm Based On Adaptive Weighted Prediction by Abd Razak, Siti Safwana

    Published 2019
    “…Comparison of this framework continue in some of the state-of-the-arts algorithm in the literature and the results is outperformed based on the proposed algorithm experimental result.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  19. 19

    Agent-based extraction algorithm for computational problem solving by Rajabi, Maryam

    Published 2015
    “…On the other hand, agent-based model offers a good method to solve complex computational problems. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Application of a simple mono window land surface temperature algorithm from landsat ETM+ over al Qassim, Saudi Arabia by Lim, H.S, Mat Jafri, M·Z, Abdullah, K, Sultan AlSultan

    Published 2012
    “…The land surface emissivity and solar angle values were needed in order to apply these in the proposed algorithm. The surface emissivity values were computed based on the NDVI values. …”
    Get full text
    Get full text
    Get full text
    Article