Search Results - (( develop computing ((a algorithm) OR (new algorithm)) ) OR ( java implication based algorithm ))

Search alternatives:

Refine Results
  1. 1
    The implications for ahybrid detection technique against malicious sqlattacks on web applications

    The implications for ahybrid detection technique against malicious sqlattacks on web applications by Bahjat Arif, Sarajaldeen Akram, Wani, Sharyar

    Published 2025
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    Digital Quran With Storage Optimization Through Duplication Handling And Compressed Sparse Matrix Method

    Digital Quran With Storage Optimization Through Duplication Handling And Compressed Sparse Matrix Method by Ashraf Saleh Mohammad Alomoush

    Published 2024
    thesis::doctoral thesis
    Save to List
    Saved in:
  3. 3
    Extended development of a Computer Aided Detection (CAD) system for brain bleed in CT / Muhammad Illyas Abdul Muhji

    Extended development of a Computer Aided Detection (CAD) system for brain bleed in CT / Muhammad Illyas Abdul Muhji by Muhammad Illyas, Abdul Muhji

    Published 2018
    “…In this study, 227 volumes of brain CT images were used to develop and validate the CAD. The new develop algorithm is set to register image of brain patient in order to determine the rotation angle for brain realignment. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  4. 4
    Augmentation of basic-line-search and quick-simplex-method algorithms to enhance linear programming computational performance

    Augmentation of basic-line-search and quick-simplex-method algorithms to enhance linear programming computational performance by Nor Azlan, Nor Asmaa Alyaa

    Published 2021
    “…The thesis was set to three objectives as follows; to develop a new augmentation algorithm of Simplex method from the existed augmentation studies; to integrate the superiorities of the QSM and BLSA algorithms that can enhance computational performance; to compare the performance of the new augmentation algorithm with the conventional Simplex, QSM and BLSA in reducing iteration number. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    DESIGN AND EVALUATION OF RESOURCE ALLOCATION AND JOB SCHEDULING ALGORITHMS ON COMPUTATIONAL GRIDS

    DESIGN AND EVALUATION OF RESOURCE ALLOCATION AND JOB SCHEDULING ALGORITHMS ON COMPUTATIONAL GRIDS by MEHMOOD SHAH, SYED NASIR

    Published 2012
    “…The issue is not only to develop new algorithms, but also to evaluate them on an experimental computational grid, using synthetic and real workload traces, along with the other existing job scheduling algorithms. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  6. 6
    Implementation of New Improved Round Robin (NIRR) CPU scheduling algorithm using discrete event simulation

    Implementation of New Improved Round Robin (NIRR) CPU scheduling algorithm using discrete event simulation by Chang, Jan Voon

    Published 2015
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Designing New Block Cipher Based On Genetic Algorithm Approach

    Designing New Block Cipher Based On Genetic Algorithm Approach by Nur Hafiza Binti Zakaria, Ramlan Mahmod, Nur Izura Udzir, Zuriati Ahmad Zukarnain, Suriyani Ariffin

    Published 2024
    Article
    Save to List
    Saved in:
  8. 8
    Ant colony optimization algorithm for dynamic scheduling of jobs in computational grid

    Ant colony optimization algorithm for dynamic scheduling of jobs in computational grid by Ku-Mahamud, Ku Ruhana, Ramli, Razamin, Yusof, Yuhanis, Mohamed Din, Aniza, Mahmuddin, Massudi

    Published 2012
    “…Job scheduling problem is classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Among different optimization algorithms for job scheduling, ant colony system algorithm is a popular meta-heuristic algorithm which has the ability to solve different types of NP-hard problems.However, ant colony system algorithm has a deficiency in its heuristic function which affects the algorithm behavior in terms of finding the shortest connection between edges.This research focuses on a new heuristic function where information about recent ants’ discoveries has been considered.The new heuristic function has been integrated into the classical ant colony system algorithm.Furthermore, the enhanced algorithm has been implemented to solve the travelling salesman problem as well as in scheduling of jobs in computational grid.A simulator with dynamic environment feature to mimic real life application has been development to validate the proposed enhanced ant colony system algorithm. …”
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  9. 9
    A block cipher based on genetic algorithm

    A block cipher based on genetic algorithm by Zakaria, Nur Hafiza

    Published 2016
    “…In this research, we proposed a new block cipher algorithm based on genetic algorithm approach which shall meet the security requirements. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  10. 10
    Development of computer aided three-dimensional geometric modeler based on designer's idea in twodimensional

    Development of computer aided three-dimensional geometric modeler based on designer's idea in twodimensional by Haron, Habibollah

    Published 2006
    Get full text
    Get full text
    Monograph
    Save to List
    Saved in:
  11. 11
    Improvement and performance analysis on statistical selection algorithms

    Improvement and performance analysis on statistical selection algorithms by Kweh, Yeah Lun, Othman, Mohamed

    Published 2006
    Get full text
    Get full text
    Conference or Workshop Item
    Save to List
    Saved in:
  12. 12
    Improving resource management with multi-instance broker scheduling algorithm in hierarchical grid computing

    Improving resource management with multi-instance broker scheduling algorithm in hierarchical grid computing by Yahaya, Bakri

    Published 2016
    “…Multi-Instance Broker Scheduling Algorithm (MiBSA) has been proposed as a new scheduling algorithm to get rid of the drawback from the iHLBA algorithm. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  13. 13
    Development Of Double Stage Filter (DSF) On Stereo Matching Algorithm For 3D Computer Vision Applications

    Development Of Double Stage Filter (DSF) On Stereo Matching Algorithm For 3D Computer Vision Applications by Teo, Chee Huat

    Published 2016
    “…Thus, a new hybrid algorithm with higher accuracy of computation is developed in this project. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  14. 14
    A new algorithm for system of integral equations

    A new algorithm for system of integral equations by Rasulov, Abdujabar, Kilicman, Adem, Eshkuvatov, Zainidin K., Raimova, Gulnora

    Published 2014
    “…We develop a new algorithm to solve the system of integral equations. …”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  15. 15
    Implementation of New Improved Round Robin (NIRR) CPU scheduling algorithm using discrete event simulation

    Implementation of New Improved Round Robin (NIRR) CPU scheduling algorithm using discrete event simulation by Chang, Jan Voon, Ahmad, Idawaty

    Published 2016
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Multi-base number representation in application to scalar multiplication and pairing computation

    Multi-base number representation in application to scalar multiplication and pairing computation by Mohammed Ismail, Abdelwahed

    Published 2011
    “…Multi-bases number representation is used to construct new versions of Miller’s algorithm. These algorithms are formulated for computing Tate and ate pairing. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  17. 17
    SEALiP: A simple and efficient algorithm for listing permutation via starter set method

    SEALiP: A simple and efficient algorithm for listing permutation via starter set method by Ibrahim, Haslinda, Zake, Lugean, Omar, Zurni, Karim, Sharmila

    Published 2013
    “…In order to demonstrate the algorithm, we are keen to list the permutations with the special references for cases of three and four objects.Based on this algorithm, a new method for listing permutations is developed and analyzed.This new permutation method will be compared with the existing lexicographic method.The results revealed that this new method is more efficient in terms of computation time.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Enhancement of Ant System Algorithm for Course Timetabling Problem

    Enhancement of Ant System Algorithm for Course Timetabling Problem by Djamarus, Djasli

    Published 2009
    “…In order to develop a new algorithm for the course scheduling problem, this research follows the experimental research methodology that consist of problem analysis, designing algorithm, implementing algorithm as a computer program in order to examine the results, analyzing the results, and if necessary improving the algorithm by doing all those activities over and over again. …”
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  19. 19
    Crosstalk-Free Scheduling Algorithms for Routing in Optical Multistage Interconnection Networks

    Crosstalk-Free Scheduling Algorithms for Routing in Optical Multistage Interconnection Networks by Raja Mohd Auzar, Tengku Dian Shahida

    Published 2009
    “…Based on Zero algorithms, a Modified Zero algorithm is developed to achieve a crosstalk-free version of the algorithm. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  20. 20
    The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment

    The Development Of A Robust Algorithm For Uav Path Planning In 3d Environment by Kok, Kai Yit

    Published 2016
    “…Thus, a new algorithm known as infection evolution (IE) was developed in this study. …”
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: