Search Results - (( java implementation path algorithm ) OR ( using _ 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
    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:
  5. 5
    Parallel Optical Window Algorithm Applied to Optical Multistage Interconnection Network

    Parallel Optical Window Algorithm Applied to Optical Multistage Interconnection Network by Othman, Mohamed, Abdullah, Monir, Johari, Rozita

    Published 2008
    “…In this paper, a new parallel algorithm of the window method is developed called the Balanced Parallel Window Method (BPWM) algorithm. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    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
    “…Sliding window identification algorithms use information from a store of data to optimise on-line learning. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  7. 7
    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
    “…Window algorithms suffer from the window size. The larger the window, the greater the number of unnecessary comparisons, and the smaller the window size may prevent the detection of duplicates that are supposed to be within the window. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    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:
  9. 9
    Optimized crossover genetic algorithm for vehicle routing problem with time windows

    Optimized crossover genetic algorithm for vehicle routing problem with time windows by Nazif, Habibeh, Lee, Lai Soon

    Published 2010
    “…Conclusion/Recommendations: This study presented a genetic algorithm for solving vehicle routing problem with time windows using an optimized crossover operator. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Experimental study of urban growth pattern classification using moving window algorithm

    Experimental study of urban growth pattern classification using moving window algorithm by Ghani N.L.A., Abidin S.Z.Z.

    Published 2023
    Article
    Save to List
    Saved in:
  11. 11
    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
    “…Round trip time (RTT) and packet length were captured over several network sessions. They were used as input and their effects were evaluated on window size as the output. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  12. 12
    SLIDING WINDOW TRAINING ALGORITHMS USING MLP-NETWORK FOR CORRELATED AND LOST PACKET DATA

    SLIDING WINDOW TRAINING ALGORITHMS USING MLP-NETWORK FOR CORRELATED AND LOST PACKET DATA by AHMED IZZELDIN, HUZAIFA TAWFEIG

    Published 2012
    “…The SW learning is investigated with different resetting criterion, diierent step size choices and different window sizes in addition to improving the existing SW module by proposing different data store management @SM) techniques that is used to reduce correlation inside the window store. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Solving multi-objective dynamic vehicle routing problem with time windows using multi-objective algorithm

    Solving multi-objective dynamic vehicle routing problem with time windows using multi-objective algorithm by Khoo, Thau Soon

    Published 2022
    “…Our algorithm uses non-fitness evolutionary distributed parallelized adaptive large neighbourhood search (NEDPALNS). …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  14. 14
    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 Zakaria, M.N.

    Published 2017
    “…This paper presents a stochastic partially optimized cyclic shift crossover operator for the optimization of the multi-objective vehicle routing problem with time windows using genetic algorithms. The aim of the paper is to show how the combination of simple stochastic rules and sequential appendage policies addresses a common limitation of the traditional genetic algorithm when optimizing complex combinatorial problems. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    An optimized aggregate marker algorithm for bandwidth fairness improvement in classifying traffic networks

    An optimized aggregate marker algorithm for bandwidth fairness improvement in classifying traffic networks by Al-Kharasani, Ameen Mohammed Abdulkarem, Othman, Mohamed, Abdullah, Azizol, Kweh, Yeah Lun

    Published 2016
    “…Extensive simulations were carried out to implement the algorithm using the NS2 simulator and compare the proposed marker algorithm with several other algorithms. …”
    Get full text
    Get full text
    Get full text
    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
    Enhancement on the modified artificial bee colony algorithm to optimize the vehicle routing problem with time windows

    Enhancement on the modified artificial bee colony algorithm to optimize the vehicle routing problem with time windows by Sankor, Salah Mortada Shahen

    Published 2022
    “…The proposed algorithm was evaluated using benchmark datasets comprising 56 VRPTW instances and 56 Pickup and Delivery Problems with Time Windows (PDPTW). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    Flexible window-based scheduling with critical worst case latency evaluations for real time traffic in time sensitive networks

    Flexible window-based scheduling with critical worst case latency evaluations for real time traffic in time sensitive networks by Muftah, Shalghum Khaled

    Published 2022
    “…The first part introduces a flexible window-overlapping scheduling (FWOS) algorithm that allows the TT windows to overlap in GCL implementations. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    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:
  20. 20
    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
    “…The validation analysis shows that the proposed method has a higher forecasting accuracy than the previous method of sliding window algorithm.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:

Search Tools: