Search Results - (( based instruction based algorithm ) OR ( java application optimization 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

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

    RISC-V instruction set extension on blockchain application by Cheong , Kin Seng

    Published 2024
    “…This project is an instruction set extension project based on RISC-V architecture for academic purpose. …”
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
  7. 7

    Cache replacement algorithm using hierarchical allocation scheduling by Mohd Sharif, Mohammad Faizal

    Published 2014
    “…HAS is to schedule the instructions based on the priority of instructions from the aspect of space and time. …”
    Get full text
    Get full text
    Thesis
  8. 8
  9. 9
  10. 10

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

    Design of DNA sequence alignment accelerated system using 2-dimensional array and custom instruction on FPGA / Nur Dalilah Ahmad Sabri by Ahmad Sabri, Nur Dalilah

    Published 2018
    “…Thus, this research concentrates on the optimization techniques based on Custom Instruction (CI) and Rectangular Dimensional array (2D) that proposed on Smith-Waterman (SW) algorithm. …”
    Get full text
    Get full text
    Thesis
  12. 12
  13. 13

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

    Compiler-based prefetching algorithm for recursive data structure by Anuar, Nurulhaini

    Published 2007
    “…This project investigates compiler-based prefetching for pointer based applications particularly those containing Recursive Data Structures (RDS) and designs the proposed algorithm. …”
    Get full text
    Get full text
    Get full text
    Thesis
  15. 15

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

    Improving Class Timetabling using Genetic Algorithm by Qutishat, Ahmed Mohammed Ali

    Published 2006
    “…We have targeted the research on class timetabling problem. Hence, Genetic Algorithm (GA) is used as one of the most popular optimization solutions. …”
    Get full text
    Get full text
    Get full text
    Thesis
  17. 17
  18. 18
  19. 19

    Features selection for intrusion detection system using hybridize PSO-SVM by Tabaan, Alaa Abdulrahman

    Published 2016
    “…Hybridize Particle Swarm Optimization (PSO) as a searching algorithm and support vector machine (SVM) as a classifier had been implemented to cope with this problem. …”
    Get full text
    Get full text
    Thesis
  20. 20

    Path planning for unmanned aerial vehicles using visibility line-based methods by Omar, Rosli

    Published 2011
    “…The proposed 2D path planning algorithms, on the contrary, select a relatively smaller number of vertices using the so-called base line (BL), thus they are computationally efficient. …”
    Get full text
    Get full text
    Thesis