Search Results - (( development using discretization algorithm ) OR ( java implementation path 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
    Implementation of New Improved Round Robin (NIRR) CPU scheduling algorithm using discrete event simulation

    Implementation of New Improved Round Robin (NIRR) CPU scheduling algorithm using discrete event simulation by Chang, Jan Voon, Ahmad, Idawaty

    Published 2016
    “…However the lack of details of general NIRR simulation model is a clear limitation for the further improvement of the algorithm. The main objective of this research is to validate the NIRR algorithm by developing a comprehensive simulation model using Discrete Event Simulation (DES). …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Modification of particle swarm optimization algorithm for optimization of discrete values

    Modification of particle swarm optimization algorithm for optimization of discrete values by Mohd Yassin, Ahmad Ihsan, Jusoh, Muhammad Huzaimy, Abdul Rahman, Farah Yasmin

    Published 2011
    “…We propose a novel modification to the PSO algorithm to perform rapid discrete optimization. The proposed Discrete-PSO method (DPSO) uses a rescaling equation to convert the continuous-valued positions into discrete-valued variables. …”
    Get full text
    Get full text
    Research Reports
    Save to List
    Saved in:
  7. 7
    Model structure selection for a discrete-time non-linear system using a genetic algorithm

    Model structure selection for a discrete-time non-linear system using a genetic algorithm by Ahmad, R., Jamaluddin, H., Hussain, M. A.

    Published 2004
    “…The performance of the proposed algorithm is also compared to the model developed using the orthogonal least squares (OLS) algorithm. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Model structure selection for a discrete-time non-linear system using a genetic algorithm

    Model structure selection for a discrete-time non-linear system using a genetic algorithm by Ahmad, R., Jamaluddin, H., Hussain, M. A.

    Published 2004
    “…The performance of the proposed algorithm is also compared to the model developed using the orthogonal least squares (OLS) algorithm. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    Model structure selection for a discrete-time non-linear system using genetic algorithm

    Model structure selection for a discrete-time non-linear system using genetic algorithm by Ahmad, Robiah, Jamaluddin , Hishamuddin, Hussain, Mohd. Azlan

    Published 2004
    “…The performance of the proposed algorithm is also compared to the model developed using the orthogonal least squares (OLS) algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Multi-state PSO GSA for solving discrete combinatorial optimization problems

    Multi-state PSO GSA for solving discrete combinatorial optimization problems by Ismail, Ibrahim

    Published 2016
    “…These four algorithms can be used to solve discrete combinatorial optimization problems (COPs). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Implementation of New Improved Round Robin (NIRR) CPU scheduling algorithm using discrete event simulation

    Implementation of New Improved Round Robin (NIRR) CPU scheduling algorithm using discrete event simulation by Chang, Jan Voon

    Published 2015
    “…However the lack of details of general NIRR simulation model is a clear limitation for the further improvement of the algorithm. The main objective of this research is to validate the NIRR algorithm by developing a comprehensive simulation model using Discrete Event Simulation (DES). …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    Multivariable system identification for dynamic discrete-time nonlinear system using genetic algorithm

    Multivariable system identification for dynamic discrete-time nonlinear system using genetic algorithm by Ahmad, R., Jamaluddin, H., Hussain, Mohd Azlan

    Published 2002
    “…The development of a multivariable system identification model for dynamic discrete-time nonlinear system using genetic algorithm was discussed and analysed. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  13. 13
    Multivariable system identification for dynamic discrete-time nonlinear system using genetic algorithm

    Multivariable system identification for dynamic discrete-time nonlinear system using genetic algorithm by Ahmad, R., Jamaluddin, H., Hussain, M. A.

    Published 2002
    “…The development of a multivariable system identification model for dynamic discrete-time nonlinear system using genetic algorithm was discussed and analysed. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  14. 14
    Model structure selection for a discrete-time non-linear system using a genetic algorithm

    Model structure selection for a discrete-time non-linear system using a genetic algorithm by Ahmad, R., Jamaluddin, H., Hussain, Mohd Azlan

    Published 2004
    “…The performance of the proposed algorithm is also compared to the model developed using the orthogonal least squares (OLS) algorithm. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Chebyshev approximation of discrete polynomials and splines

    Chebyshev approximation of discrete polynomials and splines by Che Seman, Fauziahanim

    Published 2004
    “…These algorithms use either cubic splines or Lagrange polynomials to construct the approximation function. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Chebyshev approximation of discrete polynomials and splines

    Chebyshev approximation of discrete polynomials and splines by Che Seman, Fauziahanim

    Published 2004
    “…These algorithms use either cubic splines or Lagrange polynomials to construct the approximation function. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    Integrated optimal control and parameter estimation algorithms for discrete-time nonlinear stochastic dynamical systems

    Integrated optimal control and parameter estimation algorithms for discrete-time nonlinear stochastic dynamical systems by Kek, Sie Long

    Published 2011
    “…This thesis describes the development of an efficient algorithm for solving nonlinear stochastic optimal control problems in discrete-time based on the principle of model-reality differences. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  18. 18
    Discretization of crack propagation on parallel computing : complexity and parallel algorithms with source code

    Discretization of crack propagation on parallel computing : complexity and parallel algorithms with source code by Alias, Norma, Islam, Md. Rajibul

    Published 2010
    “…The element stiffness matrix which had been set up earlier can be used to describe the elastic deformation since the numerical FEM is emphasized as a platform for discretization of one-dimensional continua problems where the stress is uniaxial and implemented on parallel algorithm using the distributed parallel computer system. …”
    Get full text
    Get full text
    Get full text
    Book Section
    Save to List
    Saved in:
  19. 19
    A discrete simulated kalman filter optimizer for combinatorial optimization problems

    A discrete simulated kalman filter optimizer for combinatorial optimization problems by Suhazri Amrin, Rahmad

    Published 2022
    “…Due to the limitation of the SKF algorithm which only able to operate in continuous search space, the proposed algorithm makes use of a new interpretation that incorporates mutation and Hamming distance, allowing the proposed algorithm to function in discrete search space. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    A discrete event simulation framework for utility accrual scheduling algorithm in uniprocessor environment

    A discrete event simulation framework for utility accrual scheduling algorithm in uniprocessor environment by Ahmad, Idawaty, K. Subramaniam, Shamala, Othman, Mohamed, Ahmad Zukarnain, Zuriati

    Published 2011
    “…Approach: The study focused on the proposed and the development of an event based discrete event simulator for the existing General Utility Scheduling (GUS) to facilitate the reuse of the algorithm under a common simulation environment. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: