Search Results - (( java application optimization algorithm ) OR ( basic computer best algorithm ))

Refine Results
  1. 1
  2. 2

    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
  3. 3

    Mobile First-Person Shooter (FPS) Game Using Basic Theta* Algorithm / Muhammad Syurahbil Abd Rohaman by Abd Rohaman, Muhammad Syurahbil

    Published 2020
    “…On a smaller game map, the algorithm still takes an acceptable computing time but on a larger size map, the computation time suffers a lot. …”
    Get full text
    Get full text
    Thesis
  4. 4

    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
  5. 5
  6. 6

    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
    “…This research will be focused on determining the best shortest path algorithm for the first possible best (fastest, safest and cheapest) route and also to search the other possible best routes. …”
    Get full text
    Get full text
    Monograph
  7. 7
  8. 8

    Flowshop scheduling using artificial bee colony (ABC) algorithm with varying onlooker bees approaches by Mohd Pauzi, Nur Fazlinda

    Published 2015
    “…A simulation computer program was developed using Visual Basic Editor in Microsoft excel 2007. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
  9. 9
  10. 10
  11. 11
  12. 12

    Hexagon pattern particle swarm optimization based block matching algorithm for motion estimation / Siti Eshah Che Osman by Che Osman, Siti Eshah

    Published 2019
    “…Block Matching Algorithm (BMA) is a technique used to minimize the computational complexity of motion estimation in video coding application. …”
    Get full text
    Get full text
    Thesis
  13. 13
  14. 14

    Computer Lab Timetabling Using Genetic Algorithm Case Study - Unit ICT by Abdullah, Amran

    Published 2006
    “…Genetic Algorithm is one of the most popular optimization solutions used in various applications such as scheduling. …”
    Get full text
    Get full text
    Thesis
  15. 15
  16. 16
  17. 17

    Human emotion recognition for computer games player using AdaBoost algorithm / Muhamad Nur Adhwa Muhamad Shukri by Muhamad Shukri, Muhamad Nur Adhwa

    Published 2017
    “…In conclusion, this application was developed in order to help computer games player make the best decision before purchasing a computer game on market. …”
    Get full text
    Get full text
    Thesis
  18. 18

    Examination timetabling using genetic algorithm case study: KUiTTHO by Mohd Salikon, Mohd Zaki

    Published 2005
    “…Genetic Algorithm (GA) is one of the most popular optimization solutions. …”
    Get full text
    Get full text
    Thesis
  19. 19

    Examination Timetabling Using Genetic Algorithm Case Study : KUiTTHO by Mohd. Zaki, Mohd. Salikon

    Published 2005
    “…Genetic Algorithm (GA) is one of the most popular optimization solutions. …”
    Get full text
    Get full text
    Get full text
    Thesis
  20. 20

    Block matching algorithms for motion estimation using modified Cross-Diamond-Hexagonal search / Abd Razak Mahmud by Mahmud, Abd Razak

    Published 2008
    “…The fast search for ME techniques have their own shapes or patterns to work with in order to produce the best matching algorithm. The shape is actually representing the number of candidate need to be evaluated and fewer numbers of candidates will reduce the complexity of computational yet trying to keep a good block matching. …”
    Get full text
    Get full text
    Thesis