Search Results - (( java implementation path algorithm ) OR ( process using minimum 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
    Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem

    Approximate maximum clique algorithm (AMCA): A clever technique for solving the maximum clique problem through near optimal algorithm for minimum vertex cover problem by Fayaz, Muhammad, Arshad,, Shakeel, Shah,, Abdul Salam, Shah, Asadullah

    Published 2018
    “…The only way left is to use the approximation algorithm of Minimum Vertex Cover (MVC) for the solution of the Maximum Clique (MC) problem. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Ground receiving station reference pair selection technique for a minimum configuration 3D emitter position estimation multilateration system

    Ground receiving station reference pair selection technique for a minimum configuration 3D emitter position estimation multilateration system by Yaro, A.S., Sha’Ameri, A.Z., Kamel, N.

    Published 2017
    “…Using the minimum number of GRSs for 3D emitter PE, a technique based on the condition number calculation is proposed to select the suitable GRS reference pair for improving the accuracy of the PE using the lateration algorithm. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  7. 7
    New algorithm for autonomous dynamic path planning in real-time intelligent robot car

    New algorithm for autonomous dynamic path planning in real-time intelligent robot car by Mohammed, Akeel Ahmed, Hassan, Mohd Khair, Aris, Ishak, Kamsani, Noor Ain

    Published 2017
    “…Different algorithms have been used to address this problem by considering the optimal path with minimum cost; however, these algorithms did not consider the execution time to find such path. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Efficient prime-based method for interactive mining of frequent patterns.

    Efficient prime-based method for interactive mining of frequent patterns. by Mohammad Hossein, Nadimi Shahraki, Mustapha, Norwati, Sulaiman, Md. Nasir, Mamat, Ali

    Published 2011
    “…Our method isolates the mining model from the mining process such that once the mining model is constructed; it can be frequently used by mining process with various minimum support thresholds. …”
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    An experience oriented-convergence improved gravitational search algorithm for minimum variance distortionless response beamforming optimum

    An experience oriented-convergence improved gravitational search algorithm for minimum variance distortionless response beamforming optimum by Darzi S., Tiong S.K., Tariqul Islam M., Rezai Soleymanpour H., Kibria S.

    Published 2023
    Article
    Save to List
    Saved in:
  10. 10
    DTWFF-pitch feature and faster neural network convergence for speech recognition

    DTWFF-pitch feature and faster neural network convergence for speech recognition by Sudirman, Rubita, Salleh, Sh. Hussain, Salleh, Shaharuddin

    Published 2007
    “…Another task included in this paper is to find the optimal global minimum of the NN surface using the conjugate gradient algorithm to replace the steepest gradient descent in the back-propagation algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    Hybrid Spatial-Artificial Intelligence Approach for Renewable Energy Sources Sites Identification and Integration in Sarawak State

    Hybrid Spatial-Artificial Intelligence Approach for Renewable Energy Sources Sites Identification and Integration in Sarawak State by Far Chen, Jong

    Published 2022
    “…It is followed by identifying RES sites using spatial data and Multi-Criteria Decision Making-Analytical Hierarchy Process (MCDM-AHP) algorithm. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  12. 12
    Multi objective optimisation for high speed end milling using simulated annealing algorithm

    Multi objective optimisation for high speed end milling using simulated annealing algorithm by Al Hazza, Muataz Hazza Faizi, Adesta, Erry Yulian Triblas, Shaffiar, Norhashimah, Seder, Amin M. F., Riza, Muhammad

    Published 2015
    “…This paper presents the optimization of machining parameters in end milling processes by using the simulated annealing algorithm (SAA) as one of the unconventional methods in optimization. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  13. 13
    Enhancement processing time and accuracy training via significant parameters in the batch BP algorithm

    Enhancement processing time and accuracy training via significant parameters in the batch BP algorithm by Fatma Susilawati, Mohamad, Mumtazimah, Mohamad, Sarhan, AlDuais

    Published 2020
    “…The average accuracy training is 0.9909 and average processing time improved of dynamic algorithm is 430 times faster than the BBP algorithm. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  14. 14
    Workflow optimization in distributed computing environment for stream-based data processing model / Saima Gulzar Ahmad

    Workflow optimization in distributed computing environment for stream-based data processing model / Saima Gulzar Ahmad by Saima Gulzar, Ahmad

    Published 2017
    “…To avoid such overheads many techniques have been used, however in this thesis stream-based data processing model is used in which data is processed in the form of continuous instances of data items. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  15. 15
    Modelling and environmental assessment of heterogeneous catalysis biodiesel process using war algorithm

    Modelling and environmental assessment of heterogeneous catalysis biodiesel process using war algorithm by As Eleyana, Ali

    Published 2013
    “…WAR algorithm which acts as a comparison tool in selecting the environmentally benign design option is developed using heterogeneous catalysis and alkali homogeneous catalysis of biodiesel process as case study. …”
    Get full text
    Get full text
    Undergraduates Project Papers
    Save to List
    Saved in:
  16. 16
    SINR improvement using Firefly Algorithm (FA) for Linear Constrained Minimum Variance (LCMV) beamforming technique

    SINR improvement using Firefly Algorithm (FA) for Linear Constrained Minimum Variance (LCMV) beamforming technique by Doroody C., Tiong S.K., Darzi S.

    Published 2023
    Conference Paper
    Save to List
    Saved in:
  17. 17
    Recursive least square and fuzzy modelling using genetic algorithm for process control application

    Recursive least square and fuzzy modelling using genetic algorithm for process control application by Abdul Rahman, Ribhan Zafira, Yusof, Rubiyah, Khalid, Marzuki

    Published 2007
    “…A technique for the modelling of nonlinear process control using Recursive Least Square and Takagi-Sugeno Fuzzy System with Genetic Algorithm topology is described. …”
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  18. 18
    Multi-Objective Optimization of Minimum Quantity Lubrication in end Milling of Aluminum Alloy AA6061T6

    Multi-Objective Optimization of Minimum Quantity Lubrication in end Milling of Aluminum Alloy AA6061T6 by Najiha, M. S., M. M., Rahman, K., Kadirgama, M. M., Noor, D., Ramasamy

    Published 2015
    “…The purpose of this research is to optimize the process of minimum quantity lubrication (MQL) in the end milling of AA6061T6 using multi-objective genetic algorithm approach. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    Development of low power viterbi decoder on complex programmable logic device platform

    Development of low power viterbi decoder on complex programmable logic device platform by Abu, Mohd Azlan

    Published 2018
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    An improved algorithm for channel allocation on direct sequence spread spectrum

    An improved algorithm for channel allocation on direct sequence spread spectrum by Handrizal, M

    Published 2011
    “…Graph coloring is an assignment a color to each vertex, which each vertex that adjacent is given a different color. Graph coloring is a useful algorithm for channel allocation on Direct Sequence Spread Spectrum (DSSS).Through this algorithm,each access point (AP) that adjacent gives different channels based on colors available.Welsh Powell algorithm and Degree of saturation (Dsatur) are the popular algorithms being used for channel allocation in this domain. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: