Search Results - (( developing general permutation algorithm ) OR ( java implication based algorithm ))

Search alternatives:

  • Showing 1 - 10 results of 10
Refine Results
  1. 1
    The division free parallel algorithm for finding determinant

    The division free parallel algorithm for finding determinant by Karim, Sharmila, Omar, Zurni, Ibrahim, Haslinda

    Published 2013
    “…A cross multiplication method for determinant was generalized for any size of square matrices using a new permutation strategy.The permutation is generated based on starter sets.However, via permutation, the time execution of sequential algorithm became longer.Thus, in order to reduce the computation time, a parallel strategy was developed which is suited for master and slave paradigm of the high performance computer.A parallel algorithm is integrated with message passing interface.The numerical results showed that the parallel methods computed the determinants faster than the sequential counterparts particularly when the tasks were equally allocated.…”
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  2. 2
    Makespan algorithms and heuristic for internet-based collaborative manufacturing process using bottleneck approach

    Makespan algorithms and heuristic for internet-based collaborative manufacturing process using bottleneck approach by Bareduan, Sallehahmad, Hasan, Sulaiman

    Published 2010
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  3. 3
    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:
  4. 4
    A discrete simulated kalman filter optimizer for combinatorial optimization problems

    A discrete simulated kalman filter optimizer for combinatorial optimization problems by Suhazri Amrin, Rahmad

    Published 2022
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:
  5. 5
    AuSR1 : Authentication and self-recovery using a new image inpainting technique with LSB shifting in fragile image watermarking

    AuSR1 : Authentication and self-recovery using a new image inpainting technique with LSB shifting in fragile image watermarking by Aminuddin, Afrig, Ernawan, Ferda

    Published 2022
    Get full text
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  6. 6
    Towards a unified image quality assessment technique for cross-content image processing applications

    Towards a unified image quality assessment technique for cross-content image processing applications by Baqar, Mohtashim *

    Published 2024
    Get full text
    Thesis
    Save to List
    Saved in:
  7. 7
    Cryptanalysis and design of chaos based image encryption schemes

    Cryptanalysis and design of chaos based image encryption schemes by Wong , Kuan Wai

    Published 2025
    Get full text
    Get full text
    Final Year Project / Dissertation / Thesis
    Save to List
    Saved in:
  8. 8
    Performance evaluation of m3 bottleneck based heuristic for M1M2M3 flow shop

    Performance evaluation of m3 bottleneck based heuristic for M1M2M3 flow shop by Md Amin Hamzas, Mohd Fidzwan, Ahmad Bareduan, Salleh, Hussin, M.S., Hasnul, M.J.

    Published 2012
    Get full text
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    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:
  10. 10
    Bottleneck adjacent matching heuristics for scheduling a re-entrant flow shop with dominant machine problem

    Bottleneck adjacent matching heuristics for scheduling a re-entrant flow shop with dominant machine problem by Sh Ahmad, Sh Salleh

    Published 2009
    “…Fourth, the Bottleneck Scheduling Performance (BSP) indexes introduced in the BAM heuristics procedure could be used to ascertain that some specific generated job arrangements are the optimum schedule. As a general conclusion, this research has achieved the objectives to develop bottleneck-based makespan algorithms and heuristics applicable for re-entrant flow shop environment. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Thesis
    Save to List
    Saved in:

Search Tools: