Search Results - (( java implementation path algorithm ) OR ( problem presentation _ 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
    An Ant Colony Search Algorithm (ACSA) approach for unit commitment problem / Mohamad Masri Mohamad Jaib

    An Ant Colony Search Algorithm (ACSA) approach for unit commitment problem / Mohamad Masri Mohamad Jaib by Mohamad Jaib, Mohamad Masri

    Published 2010
    “…This thesis presents an Ant Colony Search Algorithm (ACSA) to solve unit commitment problem. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    A new cryptographic algorithm based on decomposition problem in elliptic curve cryptography / Hilyati Hanina Zazali

    A new cryptographic algorithm based on decomposition problem in elliptic curve cryptography / Hilyati Hanina Zazali by Hilyati Hanina, Zazali

    Published 2012
    “…Since subexponential-time algorithm is known for ordinary discrete logarithm problem and integer factorization problem and not for elliptic curve discrete logarithm problem, the algorithm presented for the digital signature in this study has substantially greater strength per key bit than in other digital signature algorithm…”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    An Ant Colony Search Algorithm (ACSA) approach for unit commitment problem: article / Mohamad Masri Mohamad Jaib

    An Ant Colony Search Algorithm (ACSA) approach for unit commitment problem: article / Mohamad Masri Mohamad Jaib by Mohamad Jaibt, Mohamad Masri

    Published 2010
    “…This thesis presents an Ant Colony Search Algorithm (ACSA) to solve unit commitment problem. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    An efficient method for determining all the extreme points of function with one variable

    An efficient method for determining all the extreme points of function with one variable by Pandiya, Ridwan

    Published 2014
    “…An algorithm for determining all the extreme and inflection points to one variable multi-modal global optimization problems is presented. …”
    Get full text
    Thesis
    Save to List
    Saved in:
  9. 9
    Load flow method using genetic algorithm

    Load flow method using genetic algorithm by Lok, C. W., Zin, A. A. M., Mustafa, M. W., Lo, Kueiming Lun

    Published 2003
    “…This paper presents the implemention of the simple genetic algorithm and constrained genetic algorithm to solve the load flow problem. …”
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  10. 10
    Bats echolocation-inspired algorithms for global optimisation problems

    Bats echolocation-inspired algorithms for global optimisation problems by Nafrizuan, Mat Yahya

    Published 2016
    “…This thesis presents works on swarm intelligence algorithms that are inspired by real echolocation of a colony of bats and its performance evaluation to solve optimisation problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  11. 11
    Optimization Of Bar Linkage By Using Genetic Algorithms

    Optimization Of Bar Linkage By Using Genetic Algorithms by Ramasamy, Mugilan

    Published 2005
    “…This thesis presents the method of using simple Genetic Algorithms (GAs) in optimizing the size of bar linkage with discrete design variables and continues design variables. …”
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  12. 12
    A review of genetic algorithm application in examination timetabling problem

    A review of genetic algorithm application in examination timetabling problem by Mohammed M.A., Ghani M.K.A., Obaid O.I., Mostafa S.A., Ahmad M.S., Ibrahim D.A., Burhanuddin M.A.

    Published 2023
    “…It presents many examples of using genetic algorithm in finding optimal solutions to the problem of examination timetabling at universities or institutions. …”
    Article
    Save to List
    Saved in:
  13. 13
    An investigation towards hostel space allocation problem with stochastic algorithms

    An investigation towards hostel space allocation problem with stochastic algorithms by Joe Henry Obit, Kuan, Yik Junn, Rayner Alfred, Jetol Bolongkikit, Ong, Yan Sheng

    Published 2018
    “…This research presents the study of stochastic algorithms in one of the limited study in Space Allocation Problem. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  14. 14
    Vector Evaluated Gravitational Search Algorithm (VEGSA) for multi-objective optimization problems

    Vector Evaluated Gravitational Search Algorithm (VEGSA) for multi-objective optimization problems by Zuwairie, Ibrahim, Badaruddin, Muhammad, Kamarul Hawari, Ghazali, Lim, Kian Sheng, Sophan Wahyudi, Nawawi, Zulkifli, Md. Yusof

    Published 2012
    “…This paper presents a novel algorithm, which is based on Gravitational Search Algorithm (GSA), for multiobjective optimization problems. …”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  15. 15
    Intergrated multi-objective optimisation of assembly sequence planning and assembly line balancing using particle swarm optimisation

    Intergrated multi-objective optimisation of assembly sequence planning and assembly line balancing using particle swarm optimisation by M. F. F., Ab Rashid

    Published 2013
    “…Statistical tests on the algorithms' performance indicates that the proposed MODPSO algorithm presents significant improvement in terms of larger nondominated solution numbers in Pare't o optimal, compared to comparable algorithms including GA based algorithms in both single-model and mixedmodel ASP and ALB problems. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  16. 16
    Evolutionary cost-cognizant regression test case prioritization for object-oriented programs

    Evolutionary cost-cognizant regression test case prioritization for object-oriented programs by Bello, AbdulKarim

    Published 2019
    “…Therefore, this study proposed a cost-cognizant TCP approach for object-oriented software that uses path-based integration testing to identify the possible execution path extracted from the Java System Dependence Graph (JSDG) model of the source code using forward slicing technique. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    An enumerative algorithm for the maximum clique problem

    An enumerative algorithm for the maximum clique problem by Mustafa, Mamat, Suyudi, M., Sukono, ., Bon, A.T.

    Published 2019
    “…Partial enumerative algorithms are presented for maximum clique problems which are very easy to implement. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  18. 18
    Solving traveling salesman problem on cluster compute nodes

    Solving traveling salesman problem on cluster compute nodes by I.A., Aziz, Haron, N., Mehat, M., Jung, L.T., Mustapa, A.N., Akir, E.A.P.

    Published 2009
    “…In this paper, we present a parallel implementation of a solution for the Traveling Salesman Problem (TSP). …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Shuffled frog leaping algorithm for solving economic load dispatch problem / Mohammad Ariffin Aizat Ezanee

    Shuffled frog leaping algorithm for solving economic load dispatch problem / Mohammad Ariffin Aizat Ezanee by Ezanee, Mohammad Ariffin Aizat

    Published 2015
    “…Shuffled Frog Leaping Algorithm (SFLA) is proposed to solve Economic Load Dispatch (ELD) problem. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    Quantum Processing Framework And Hybrid Algorithms For Routing Problems

    Quantum Processing Framework And Hybrid Algorithms For Routing Problems by Soltan Aghaei, Mohammad Reza

    Published 2010
    “…These quantum algorithms can be applied to solve routing problem in the quantum networks and the quantum multicomputer. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: