Search Results - (( java implementation path algorithm ) OR ( problem using stepping 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
    Optimal design of step – cone pulley problem using the bees algorithm

    Optimal design of step – cone pulley problem using the bees algorithm by Yusof, Noor Jazilah, Kamaruddin, Shafie

    Published 2021
    “…The Bees Algorithm is used in this study to find the optimum solution for stepped-cone pulley design and found better results compared to other optimization algorithms.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Book Chapter
    Save to List
    Saved in:
  6. 6
    Solving time gap problems through the optimization of detecting stepping stone algorithm

    Solving time gap problems through the optimization of detecting stepping stone algorithm by Omar, Mohd. Nizam, Maarof, Mohd. Aizaini, Zainal, Anazida

    Published 2004
    “…This paper describes an analysis of detecting stepping stone algorithm to defeat the time gap problem. …”
    Get full text
    Get full text
    Book Section
    Save to List
    Saved in:
  7. 7
    Algorithm As A Problem Solving Technique For Teaching And Learning Of The Malay Language

    Algorithm As A Problem Solving Technique For Teaching And Learning Of The Malay Language by Jano, Zanariah, Omar, Norliza, Nazir, Faridah

    Published 2019
    “…This conceptual teaching and learning algorithm was conducted in five steps namely the induction set; step 1; step 2; step 3; and enrichment and recovery. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Enhancing harmony search parameters based on step and linear function for bus driver scheduling and rostering problems

    Enhancing harmony search parameters based on step and linear function for bus driver scheduling and rostering problems by Mansor, Nur Farraliza

    Published 2018
    “…Optimization is a major challenge in numerous practical world problems.According to the “No Free Lunch (NFL)” theorem,there is no existing single optimizer algorithm that is able to resolve all issues in an effective and efficient manner.It is varied and need to be solved according to the specific capabilities inherent to certain algorithms making it hard to foresee the algorithm that is best suited for each problem.As a result,the heuristic technique is adopted for this research as it has been identified as a potentially suitable algorithm.Alternative heuristic algorithms are also suggested to obtain optimal solutions with reasonable computational effort.However,the heuristic approach failed to produce a solution that nears optimum when the complexity of a problem increases;therefore a type of nature-inspired algorithm known as meta-euristics which utilises an intelligent searching mechanism over a population is considered and consequently used.The meta-heuristic approach is widely used to substitute heuristic terms and is broadly applied to address problems with regards to driver scheduling.However,this meta-heuristic technique is still unable to address the fairness issue in the scheduling and rostering problems.Hence,this research proposes a strategy to adopt an amendment of the harmony search algorithm in order to address the fairness issue which in turn will escalate the level of fairness in driver scheduling and rostering.The harmony search algorithm is classified as a meta-heuristics algorithm that is capable of solving hard and combinatorial or discrete optimisation problems.In this respect,the three main operators in harmony search,namely the Harmony Memory Consideration Rate (HMCR),Pitch Adjustment Rate (PAR) and Bandwidth (BW) play a vital role in balancing local exploitation and global exploration.These parameters influence the overall performance of the HS algorithm,and therefore it is crucial to fine-tune them. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Algorithm as a problem solving technique for teaching and learning of the Malay language

    Algorithm as a problem solving technique for teaching and learning of the Malay language by Faridah Nazir, Zanariah Jano, Norliza Omar

    Published 2019
    “…This conceptual teaching and learning algorithm was conducted in five steps namely the induction set; step 1; step 2; step 3; and enrichment and recovery. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    Pengoptimuman algoritma pengesanan batu loncatan dalam sistem pengesanan pencerobohan

    Pengoptimuman algoritma pengesanan batu loncatan dalam sistem pengesanan pencerobohan by Omar, Mohd. Nizam

    Published 2005
    “…In this research, special Top-Down methodology has been used to optimize the stepping stone algorithm. It is achieved by analyzing five stepping stone algorithms, in which each algorithm is divided into three main parts. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Algorithm as a problem solving technique for teaching and learning of the Malay language

    Algorithm as a problem solving technique for teaching and learning of the Malay language by Nazir, Faridah, Jano, Zanariah, Omar, Norliza

    Published 2019
    Get full text
    Get full text
    Get full text
    Proceeding Paper
    Save to List
    Saved in:
  12. 12
    Improving pipelined time stepping algorithm for distributed memory multicomputers

    Improving pipelined time stepping algorithm for distributed memory multicomputers by Ng, Kok Fu, Norhashidah Hj. Mohd. Ali

    Published 2010
    “…Time stepping algorithm with spatial parallelisation is commonly used to solve time dependent partial differential equations. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    A self-adaptive step-size search algorithm for the cardinality constrained portfolio optimisation problem

    A self-adaptive step-size search algorithm for the cardinality constrained portfolio optimisation problem by Zi, Xuan Loke, Say, Leng Goh, Jonathan Likoh Juis @ Juise

    Published 2024
    “…This paper proposes a Self-adaptive Step-size Search (SASS) algorithm to address a Cardinality Constrained Portfolio Optimisation Problem (CCPOP). …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceedings
    Save to List
    Saved in:
  14. 14
    Combined heat and power (CHP) economic dispatch solved using Lagrangian relaxation with surrogate subgradient multiplier updates

    Combined heat and power (CHP) economic dispatch solved using Lagrangian relaxation with surrogate subgradient multiplier updates by Sashirekha A., Pasupuleti J., Moin N.H., Tan C.S.

    Published 2023
    “…This paper presents a flexible algorithm to solve the combined heat and power (CHP) economic dispatch problem. …”
    Article
    Save to List
    Saved in:
  15. 15
    Iterative And Single-Step Solutions Of Two Dimensional Time-Domain Inverse Scattering Problem Featuring Ultra Wide Band Sensors

    Iterative And Single-Step Solutions Of Two Dimensional Time-Domain Inverse Scattering Problem Featuring Ultra Wide Band Sensors by Binajjaj, Saeed Ali Saeed

    Published 2010
    “…The imaging algorithm was based on a non-linear optimization technique from which the single-step and iterative inversion schemes were realized. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Enhancement of a Stepping Stone Detection Algorithm Using Data Mining and Associate Rule Techniques (S/O: 12896)

    Enhancement of a Stepping Stone Detection Algorithm Using Data Mining and Associate Rule Techniques (S/O: 12896) by Omar, Mohd Nizam, Ghazali, Osman, Daud, Ali Yusny, Azzali, Fazli

    Published 2020
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  17. 17
    A hybrid algorithm for finding shortest path in network routing.

    A hybrid algorithm for finding shortest path in network routing. by Soltan Aghaei, Mohammad Reza, Ahmad Zulkarnain, Zuriati, Mamat, Ali, Zainuddin, Hishamuddin

    Published 2009
    “…This wave gives an O( N ) steps quantum algorithm for identifying that record, where was used classical Dijkstra’s algorithm for finding shortest path problem in the graph of network and implement quantum search. …”
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Novel Adaptive Bacterial Foraging Algorithms for Global Optimisation with Application to Modelling of a TRS

    Novel Adaptive Bacterial Foraging Algorithms for Global Optimisation with Application to Modelling of a TRS by Ahmad Nor Kasruddin, Nasir, Nor Maniha, Abd Ghani, Tokhi, M. O.

    Published 2015
    “…In this paper, adaptive bacterial foraging algorithms and their application to solve real world problems is presented. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Sports tournament scheduling using genetic algorithm / Hafeezur Syakir Abdul Motok@Mohd Ridzuan

    Sports tournament scheduling using genetic algorithm / Hafeezur Syakir Abdul Motok@Mohd Ridzuan by Abdul Motok@Mohd Ridzuan, Hafeezur Syakir

    Published 2020
    “…In this report, a Genetic Algorithm (GA) is applied for solving University sports timetabling problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    New algorithm of two-point block method for solving boundary value problem with dirichlet and Neumann boundary conditions

    New algorithm of two-point block method for solving boundary value problem with dirichlet and Neumann boundary conditions by Phang, Pei See, Abdul Majid, Zanariah, Ismail, Fudziah, Othman, Khairil Iskandar, Suleiman, Mohamed

    Published 2013
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: