Search Results - (( java implementation path algorithm ) OR ( using a 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

    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

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

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

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

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

    Published 2005
    “…The first approach is to develop an efficient sequential algorithm for the window method. Reduction of the execution time of the algorithm in sequential platform, led to a massive improvement of the algorithm speed. …”
    Get full text
    Get full text
    Thesis
  9. 9
  10. 10
  11. 11

    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
    “…Crucial to this is the width of the sliding window. This study utilized raw data from network traffic and built a Neural Network (NN) model trained with the Cuckoo Search (CS) algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  12. 12

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

    Published 2012
    “…The crucial part about MLP is the learning or training process in which the weights are tuned on the presence of input data to produce a reliable and accurate estimation. This thesis gives a systematic investigation of various MLP learning mainly Sliding Window (SW) learning mode which is treated as the adaptation of offline algorithms into online application Consequently this thesis reviews various offline algorithms including: batch backpropagation, nonlinear conjugate gradient, limited memory and full-memory Broyden, Fletcher, Goldfarb and Shanno algorithms and different forms of the latest proposed bimary ensemble learning. …”
    Get full text
    Get full text
    Thesis
  13. 13

    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. …”
    Get full text
    Get full text
    Article
  14. 14

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

    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
    “…This article analyses and evaluates a new time sliding window traffic marker algorithm called the Optimized time sliding window Three Colour Marker (OtswTCM). …”
    Get full text
    Get full text
    Get full text
    Article
  16. 16

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

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

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

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

    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