Search Results - (( java implementation path algorithm ) OR ( using computational window algorithm ))

Search alternatives:

Refine Results
  1. 1
    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:
  2. 2
    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:
  3. 3
    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:
  4. 4
    Date store management in sliding window based on-line identification algorithms

    Date store management in sliding window based on-line identification algorithms by Asirvadam , Vijanth Sagayan, McLoone, Sean, Irwin, George W

    Published 2001
    Get full text
    Get full text
    Conference or Workshop Item
    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
    Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network

    Efficient Sequential and Parallel Routing Algorithms in Optical Multistage Interconnection Network by Abduh Kaid, Monir Abdullah

    Published 2005
    “…This routing problem is an NPhard problem. Many algorithms are designed by many researchers to perform this routing such as window method, sequential algorithm, degree-descending algorithm, simulated annealing algorithm, genetic algorithm and ant colony algorithm.This thesis explores two approaches, sequential and parallel approaches. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Examining the round trip time and packet length effect on window size by using the Cuckoo search algorithm

    Examining the round trip time and packet length effect on window size by using the Cuckoo search algorithm by Abubakar, Adamu, Chiroma, Haruna, Khan, Abdullah, Mohamed, Elbaraa Eldaw Elnour

    Published 2016
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    An enhancement of sliding window algorithm for rainfall forecasting

    An enhancement of sliding window algorithm for rainfall forecasting by Azahar, Siti Nor Fathihah, Othman, Mahmod, Saian, Rizauddin

    Published 2017
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  9. 9
    Efficient management of Top-k queries over Uncertain Data Streams with dynamic Sliding Window Model

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

    Published 2024
    “…This method reduces computational costs by efficiently handling the insertion and exit policy for the appropriate tuple candidates within a specified window frame. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Improving the efficiency of clustering algorithm for duplicates detection

    Improving the efficiency of clustering algorithm for duplicates detection by Emran, Nurul Akmar, Abdul Rahim, Abdulrazzak Ali Mohamed, Kamal Baharin, Safiza Suhana, Othman, Zahriah, Salem, Awsan Thabet, Abd Aziz, Maslita, Md. Bohari, Nor Mas Aina, Abdullah, Noraswaliza

    Published 2023
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    Towards lowering computational power in IoT systems: Clustering algorithm for high-dimensional data stream using entropy window reduction

    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
    “…The results also show low memory usage and computing power in comparison with the baseline algorithms. � 2023 THE AUTHORS…”
    Article
    Save to List
    Saved in:
  12. 12
    Metaheuristics with disposal facility positioning for the waste collection VRP with time windows

    Metaheuristics with disposal facility positioning for the waste collection VRP with time windows by Benjamin, Aida Mauziah, Beasley, J. E.

    Published 2013
    “…This paper improves heuristic algorithms presented in Benjamin and Beasley (Comput Oper Res 37(12):2270–2280, 2010) for solving the waste collection vehicle routing problem with time windows, particularly the real life waste collection benchmark problems from Kim et al.…”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    Comparison of malware detection model using supervised machine learning algorithms / Syamir Mohd Shahirudin

    Comparison of malware detection model using supervised machine learning algorithms / Syamir Mohd Shahirudin by Mohd Shahirudin, Syamir

    Published 2022
    Get full text
    Get full text
    Student Project
    Save to List
    Saved in:
  14. 14
    Window based personalized time management system

    Window based personalized time management system by Siew Ann, Lilian Tong

    Published 2012
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  15. 15
    Intelligent signature detection for scanning Internet Worms

    Intelligent signature detection for scanning Internet Worms by Rasheed M.M., Ghazali O., Norwawi N.M.

    Published 2024
    journal::journal article
    Save to List
    Saved in:
  16. 16
    Optimisation of vehicle routing problem with time windows using Harris Hawks optimiser

    Optimisation of vehicle routing problem with time windows using Harris Hawks optimiser by Chai, S. W., Kamaluddin, M. R., Ab Rashid, M. F. F.

    Published 2022
    “…The main objective of the study is to minimise the number of vehicles to be assigned for the routing problem subjected to the given time windows. The problem was optimised using a new algorithm known as Harris Hawks Optimiser (HHO). …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    Application of a simple mono window land surface temperature algorithm from landsat ETM+ over al Qassim, Saudi Arabia

    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 proposed technique employed a mono window LST algorithm for retrieving surface temperature from Landsat ETM+. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Stochastic partially optimized cyclic shift crossover for multi-objective genetic algorithms for the vehicle routing problem with time-windows

    Stochastic partially optimized cyclic shift crossover for multi-objective genetic algorithms for the vehicle routing problem with time-windows by Pierre, D.M., Zakaria, N.

    Published 2017
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Line clipping based on parallelism approach and midpoint intersection

    Line clipping based on parallelism approach and midpoint intersection by Hattab, Adel Salem Abdullah, Yusof, Yuhanis

    Published 2014
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  20. 20
    Metaheuristics for the waste collection vehicle routing problem with time windows, driver rest period and multiple disposal facilities

    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
    Save to List
    Saved in:

Search Tools: