Search Results - (( developing e path algorithm ) OR ( java application learning algorithm ))

Refine Results
  1. 1
  2. 2

    Investigating and developing the best method in shortest path for implementing a geographical information system (e-map) for Peninsular Malaysia by Ahmad, Ab. Rahman, Zenon , Nasaruddin, Hassan, Haswadi

    Published 2005
    “…A development of GIS database is also involved in prototype covering the road network in Peninsular Malaysia (the e-map) will be developed to show the viability or validity of the findings. …”
    Get full text
    Get full text
    Monograph
  3. 3
  4. 4

    Meta-Heuristic Algorithms for Learning Path Recommender at MOOC by Son, N.T., Jaafar, J., Aziz, I.A., Anh, B.N.

    Published 2021
    “…We have developed Metaheuristic algorithms includes the Genetic Algorithm (GA) and Ant Colony Optimization Algorithm (ACO), to solve the proposed model. …”
    Get full text
    Get full text
    Article
  5. 5
  6. 6
  7. 7

    Development of Path Loss Models for Smooth and Convex Surfaces Terrains in Malaysian Environment by Wong, Peng Kiong

    Published 2004
    “…This study describes the development of path loss prediction model for smooth and convex surfaces terrains in Malaysian environment. …”
    Get full text
    Get full text
    Thesis
  8. 8

    Resource-Efficient Coverage Path Planning for UAV-Based Aerial IoT Gateway by Nurul Saliha A. Ibrahim, Nurul Saliha A. Ibrahim, Faiz A. Saparudin, Faiz A. Saparudin

    Published 2023
    “…The EECPP is composed of two algorithms: the Stop Point Prediction Algorithm using K-Means, and Path Planning Algorithm using Particle Swarm Optimization. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    Computationally-efficient path planning algorithms in obstacle-rich environments based on visibility graph method by Abdul Latip, Nor Badariyah

    Published 2018
    “…Cun·ent studies have been focused on developing path planning algorithms to satisfy the criteria of path planning namely minimum path length, low computation time and complete, i.e., it gives positive result if a path is available or negative if otherwise. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  10. 10
  11. 11
  12. 12
  13. 13
  14. 14
  15. 15
  16. 16
  17. 17
  18. 18
  19. 19
  20. 20