Search Results - (( program research path algorithm ) OR ( java application optimization algorithm ))

Refine Results
  1. 1
  2. 2

    Path planning algorithm for a car like robot based on MILP method by Mohd Sadri, Mohd Pawzi

    Published 2013
    “…The findings of this research have shown that the MILP method can be used in the path planning problem in terms of finding a safe and shortest path. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  3. 3
  4. 4

    Performance evaluation of real-time multiprocessor scheduling algorithms by Alhussian, H., Zakaria, N., Abdulkadir, S.J., Fageeri, S.O.

    Published 2016
    “…These results suggests that optimal algorithms may turn to be non-optimal when practically implemented, unlike USG which reveals far less scheduling overhead and hence could be practically implemented in real-world applications. …”
    Get full text
    Get full text
    Conference or Workshop Item
  5. 5
  6. 6

    Automated path testing using the negative selection algorithm by Shayma Mustafa Mohi-Aldeen, Radziah Mohamad, Safaai Deris

    Published 2017
    “…Negative selection algorithm (NSA) has been used in this paper to generate test data for path testing automatically. …”
    Get full text
    Get full text
    Indexed Article
  7. 7

    Route Optimization System by Zulkifli, Abdul Hayy

    Published 2005
    “…After much research into the many algorithms available, and considering some, including Genetic Algorithm (GA), the author selected Dijkstra's Algorithm (DA). …”
    Get full text
    Get full text
    Final Year Project
  8. 8
  9. 9
  10. 10
  11. 11
  12. 12

    Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms by Koh, Johnny Siaw Paw

    Published 2008
    “…The simulation results indicate that the algorithm is able to segregate and assign the tasks for each scanning head and also able to find the shortest scanning path for different types of objects coordination. …”
    Get full text
    Get full text
    Thesis
  13. 13
  14. 14

    Scheduling of batch process plant / Abdul Aziz Abu Bakar by Abu Bakar, Abdul Aziz

    Published 1995
    “…Batch production is used throughout the process industries for the manufacture of fine chemical, plastics, pharmaceuticals, paints, ceramics, cosmetics, or whatever production quantities are small, product value is very high or product demand pattern is changeable. This research work is devoted to software development of scheduling and control algorithm of batch process plant using shortest path method developed by Dijkstra and K* shortest path method developed by Jin Y. …”
    Get full text
    Get full text
    Student Project
  15. 15

    Development of robust control scheme for wheeled mobile robot in restricted environment by Muhammad Sawal, A Radzak

    Published 2021
    “…A simulation study of WMR control in pre-planned paths in two environments namely, zigzag and highly curved terrains, has been conducted to verify the proposed algorithm and compare it with other existed algorithms. …”
    Get full text
    Get full text
    Thesis
  16. 16
  17. 17
  18. 18

    Very Large Scale Integration Cell Based Path Extractor For Physical To Layout Mapping In Fault Isolation Work by Pragasam, Matthew

    Published 2017
    “…Therefore the development of a path extractor program which is capable of extracting all possible paths from these start to end signals can save engineers time in tracing components involved between a fault line. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Enhancement of the scheduling algorithm (software and interfacing development)/ Zuraini Ab Rashid by Ab Rashid, Zuraini

    Published 1996
    “…The batch process is economically desirable whenever a complex product quantity is small but the product value or product demand is very high. This research work describe the enhancement of scheduling algorithm of batch process using shortest path and k th shortest path. …”
    Get full text
    Get full text
    Student Project
  20. 20