Search Results - (( java case selection algorithm ) OR ( basic computer path algorithm ))

Refine Results
  1. 1

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

    Published 2020
    “…It can be concluded that Basic Theta* can produce a shorter path compared to A* but with the price of having a higher computation time. …”
    Get full text
    Get full text
    Thesis
  2. 2
  3. 3
  4. 4
  5. 5

    Integration of enchanced jump point search (JPS) algorithm with modified bresenham technique for path planning in virtual grid-based environment by Nurul Atikah Janis

    Published 2018
    “…Jump Point Search is one of the path finding algorithm with huge advantage of maintaining zero memory overhead as no preprocessing process involved. …”
    Get full text
    Get full text
    Get full text
    Thesis
  6. 6

    Java based expert system for selection of natural fibre composite materials by Ahmed Ali, Basheer A., Salit, Mohd Sapuan, Zainudin, Edi Syams, Othman, Mohamed

    Published 2013
    “…Computer oriented materials selection and knowledge-based expert systems are the prevailing approach in materials selection. …”
    Get full text
    Get full text
    Get full text
    Article
  7. 7
  8. 8
  9. 9

    Travelling Salesman Problem using Prim Algorithm in High Performance Computing by Wan Harun, Wan Nurhafizah

    Published 2007
    “…This preliminary report emphasizes on the basic terms of the efficient job scheduling algorithm for traveling salesman problem in high performance computing. …”
    Get full text
    Get full text
    Final Year Project
  10. 10
  11. 11

    Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection by Dhany, Saputra

    Published 2008
    “…By storing intermediated atabasesin to SPM-Tree Framework,the sequence database can be stored into memory and the index set may be built. Using Java as a case study, a series of experiment was conducted to select a suitable API class named Collections for this framework.The experimental results show that Separator Database always improves, exponentially in some cases, PrefixSpan with pseudoprojection. …”
    Get full text
    Thesis
  12. 12

    Ant system with heuristics for capacitated vehicle routing problem by Tan, Wen Fang

    Published 2013
    “…Finally, the proposed ASH was tested on two well known benchmark data sets to evaluate its performance and effectiveness. The computational results suggest that the AS approach embedded with heuristic(s) outperforms the pure AS algorithm. …”
    Get full text
    Get full text
    Thesis
  13. 13
  14. 14

    Separator Database and SPM Tree Framework for Mining Sequential Patterns Using Prefixspan with Pseudoprojection by Saputra , Dhany, Rambli, Dayang R.A., Foong, Oi Mean

    Published 2008
    “…By storing intermediated atabasesin to SPM-Tree Framework,the sequence database can be stored into memory and the index set may be built. Using Java as a case study, a series of experiment was conducted to select a suitable API class named Collections for this framework.The experimental results show that Separator Database always improves, exponentially in some cases, PrefixSpan with pseudoprojection. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Comparison of performances of Jaya Algorithm and Cuckoo Search algorithm using benchmark functions by Ahmed, Mashuk, Nasser, Abdullah B., Kamal Z., Zamli, Heripracoyo, Sulistyo

    Published 2022
    “…To help engineers select the best metaheuristic algorithms for their problems, there is a need to evaluate the performance of different metaheuristic algorithms against each other using common case studies. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  16. 16
  17. 17

    Web-based expert system for material selection of natural fiber- reinforced polymer composites by Ahmed Ali, Basheer Ahmed

    Published 2015
    “…Several algorithms, methods and spreadsheets are being proposed by various researchers in this field to improve materials selection. …”
    Get full text
    Get full text
    Thesis
  18. 18
  19. 19

    Unconstraint assignment problem : a molecular computing approach by Zuwairie, Ibrahim, Yusei, Tsuboi, Osamu, Ono, Marzuki, Khalid

    Published 2006
    “…The proposedapproach basically consists of two phases; encoding phase and computational phase. …”
    Get full text
    Get full text
    Article
  20. 20