Search Results - (( java implementation path algorithm ) OR ( based simulation drops 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
  6. 6

    Neighbour-based on-demand routing algorithms for mobile ad hoc networks by Ejmaa, Ali Mohamed E.

    Published 2017
    “…The dropping decision of the redundant RREQ in the NCPR algorithm completely relies on preset variables, such variables require to be set by the system administrator based on the scenario. …”
    Get full text
    Get full text
    Get full text
    Thesis
  7. 7
  8. 8

    Investigation of throughput and packet drop for Hata model on VANET using NCTUns simulation software for open area and suburban area / Rosmawani Samsudin by Samsudin, Rosmawani

    Published 2012
    “…The performance measurements are based on the various parameters of in-out throughput and number of packet dropped.…”
    Get full text
    Get full text
    Thesis
  9. 9

    Solving University Examination Timetabling Problem Using Intelligent Water Drops Algorithm by Aldeeb, BA, Norwawi, NM, Al-Betar, MA, Bin Jali, MZ

    Published 2024
    “…IWD is a recent metaheuristic population-based algorithm belonging to swarm intelligent category which simulate river system. …”
    Proceedings Paper
  10. 10

    Mathematical modelling of mass transfer in a multi-stage rotating disc contactor column by Maan, Normah

    Published 2005
    “…This derivation initiated the formulation of the modified quadratic driving force, called Time-dependent Quadratic Driving Force (TQDF). Based on this formulation, a Mass Transfer of A Single Drop (MTASD) Algorithm was designed, followed by a more realistic Mass Transfer of Multiple Drops (MTMD) Algorithm which was later refined to become another algorithm named the Mass Transfer Steady State (MTSS) Algorithm. …”
    Get full text
    Get full text
    Thesis
  11. 11

    Vehicle pick-up and drop-off schedule optimization in a university setting by Teo, Chun Kit

    Published 2024
    “…Lateness will be removed using a lateness waiting time rollback mechanism. A simulated annealing-based multi-directional iterative local search algorithm is employed for solution optimization. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  12. 12

    Benchmark simulator with dynamic environment for job scheduling in grid computing by Ku-Mahamud, Ku Ruhana

    Published 2014
    “…Characteristics of jobs and resources to be used in evaluating the performance of the scheduling algorithm must reflect the dynamic nature of real grid environment.Static models of jobs and resources cannot be used to generate jobs and resources in simulating the grid environment because of the dynamic nature of the grid.This paper presents a new graph representation of jobs and resources which is practical for hybrid metaheuristic model implementation such as ant colony optimization and genetic algorithm.A dynamic model that can generate jobs and resources similar to the jobs and resources in the real grid environment is also proposed.Jobs and resources may join in or drop out from the grid.Stochastic analysis is performed on the characteristics of jobs and resources.A simulator based on the dynamic expected time to compute, has been developed and can be used as a benchmark.The simulator can generate jobs and resources with the characteristics of jobs and resources in the real grid environment.This will facilitates the evaluation of dynamic job scheduling algorithm.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  13. 13

    Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

    Published 2019
    “…In this research, two novel estimation-based metaheuristic optimization algorithms, named as Simulated Kalman Filter (SKF), and single-solution Simulated Kalman Filter (ssSKF) algorithms are introduced for global optimization problems. …”
    Get full text
    Get full text
    Thesis
  14. 14

    Mathematical modelling of mass transfer in multi-stage rotating disc contactor column by Arshad, Khairil Anuar, Talib, Jamalludin, Maan, Normah

    Published 2006
    “…This derivation initiated the formulation of the modi¯ed quadratic driving force, called Time-dependent Quadratic Driving Force (TQDF). Based on this formulation, a Mass Transfer of A Single Drop (MTASD) Algorithm was designed, followed by a more realistic Mass Transfer of Multiple Drops (MTMD) Algorithm which was later re¯ned to become another algorithm named the Mass Transfer Steady State (MTSS) Algorithm. …”
    Get full text
    Get full text
    Get full text
    Monograph
  15. 15

    Enhanced Intelligent Water Drops Algorithm for University Examination Timetabling Problems by Bashar AbedAl Mohdi Talal AlDeeb

    Published 2024
    “…The IWD is a recent metaheuristic population-based algorithm belonging to the swarm intelligent category which simulates the dynamic of the river systems. …”
    thesis::doctoral thesis
  16. 16

    A comparative study and simulation of object tracking algorithms by Ji, Yuanfa, Yin, Pan, Sun, Xiyan, Kamarul Hawari, Ghazali, Guo, Ning

    Published 2020
    “…This article introduces the popular object tracking algorithms, from common problems in object tracking to the classification of algorithms: Early classic trackingalgorithms, tracking algorithms based on kernel correlation filtering, and tracking algorithms based on deep learning. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  17. 17

    Time based internet traffic policing and shaping with Weibull traffic model / Mohd Azrul Abdullah by Abdullah, Mohd Azrul

    Published 2015
    “…Two important Weibull parameters which are shape and scale are measured. Based on the identified statistical parameters, a new Time Based Policing and Shaping algorithm is developed and simulated. …”
    Get full text
    Get full text
    Article
  18. 18

    An enhanced cluster head selection algorithm for routing in mobile AD-HOC network by Abdulsaheb, Ghaida Muttasher

    Published 2017
    “…The performance of ECRP algorithms was compared with other cluster based algorithms. …”
    Get full text
    Get full text
    Thesis
  19. 19

    A Grid-Based Reliable Routing (GBRR) protocol for wireless sensor networks by Jiang, Cailing

    Published 2019
    “…In this research, collaborated with clustering and grid-based routing features, the proposed protocol uses a combination of clustering protocols and geographical protocols with greedy algorithm to accomplish the scalability and adaptability of the randomly deployed sensor networks in a dense and large-scale network. …”
    Get full text
    Get full text
    Thesis
  20. 20