Search Results - (( its application drops algorithm ) OR ( some applications need algorithm ))*

Refine Results
  1. 1
  2. 2

    Neighbour-based on-demand routing algorithms for mobile ad hoc networks by Ejmaa, Ali Mohamed E.

    Published 2017
    “…In addition, with regard to the second algorithm SNBR, the results show that SNBR overcomes the NCPR algorithm terms of normalize routing overhead by 58.80% as its due to its dropping factor. …”
    Get full text
    Get full text
    Get full text
    Thesis
  3. 3
  4. 4
  5. 5

    VITILIGO LESION ASSESSMENT TOOL ON SMARTPHONE by BORETSKAYA, VIKTORIYA

    Published 2013
    “…The effectiveness of a treatment depends on the type of the skin disorder, as some disorders can be easily managed by creams and ointments and some need long-term treatments. …”
    Get full text
    Get full text
    Final Year Project
  6. 6
  7. 7
  8. 8
  9. 9
  10. 10
  11. 11

    An Efficient Computational Algorithm for Solving Arbitrary Sylvester Matrix Equations in Fuzzy Control Theory (S/O 14179) by Ahmad, Nazihah, Ibrahim, Haslinda

    Published 2021
    “…With that, the constructed algorithm is considered as a new contribution to the application of control system theory…”
    Get full text
    Get full text
    Monograph
  12. 12

    Simulated Kalman Filter algorithms for solving optimization problems by Nor Hidayati, Abdul Aziz

    Published 2019
    “…Its optimality has inspired the development of a metaheuristic algorithm called Heuristic Kalman Algorithm (HKA) in 2009. …”
    Get full text
    Get full text
    Thesis
  13. 13

    Iterative methods for solving split common fixed point problems in Hilbert spaces by Mohammed, Lawan Bulama

    Published 2016
    “…Our interest here is to apply these mappings to propose some algorithms for solving split common fixed point problems and its variant forms, in the end, we prove the convergence results of these algorithms. …”
    Get full text
    Get full text
    Get full text
    Thesis
  14. 14

    Dijkstra’s algorithm in Product Searching System (ProSearch) / Nur Hasni Nasrudin ... [et al.] by Nasrudin, Nur Hasni, Nasaruddin, Siti Hajar, Syed Abdul Halim, Syarifah Syafiqah Wafa, Ahmad Junid, Rosida

    Published 2015
    “…There are huge numbers of supermarkets these days. Some customers find it difficult for them to get the items that are needed for. …”
    Get full text
    Get full text
    Conference or Workshop Item
  15. 15

    HISEC: a new lightweight block cipher algorithm by Alshaikhli, Imad Fakhri Taha, Mahmood Al Dabbagh, Sufyan Salim, Alahmad, Mohammad

    Published 2014
    “…Lightweight block cipher algorithms are vital for constrained environment. There are many applications need secured lightweight block cipher algorithm like credit card, E-passport and etc. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  16. 16
  17. 17

    Deploying blockchains to simplify AI algorithm auditing by Butt, Ayesha, Zahid Junejo, Aisha, Ghulamani, Sumbul, Mahdi, Ghulam, Shah, Asadullah, Khan, Dodo

    Published 2023
    “…Moreover, this review also discusses some potential challenges that need to be addressed and some future recommendations for this integration.…”
    Get full text
    Get full text
    Get full text
    Get full text
    Proceeding Paper
  18. 18

    Survey on job scheduling mechanisms in grid environment by S. M., Argungu, Che Mohamed Arif, Ahmad Suki, Omar, Mohd Hasbullah

    Published 2015
    “…Grid systems provide geographically distributed resources for both computational intensive and data-intensive applications.These applications generate large data sets.However, the high latency imposed by the underlying technologies; upon which the grid system is built (such as the Internet and WWW), induced impediment in the effective access to such huge and widely distributed data.To minimize this impediment, jobs need to be scheduled across grid environments to achieve efficient data access.Scheduling multiple data requests submitted by grid users onto the grid environment is NP-hard.Thus, there is no best scheduling algorithm that cuts across all grids computing environments.Job scheduling is one of the key research area in grid computing.In the recent past many researchers have proposed different mechanisms to help scheduling of user jobs in grid systems.Some characteristic features of the grid components; such as machines types and nature of jobs at hand means that a choice needs to be made for an appropriate scheduling algorithm to march a given grid environment.The aim of scheduling is to achieve maximum possible system throughput and to match the application needs with the available computing resources.This paper is motivated by the need to explore the various job scheduling techniques alongside their area of implementation.The paper will systematically analyze the strengths and weaknesses of some selected approaches in the area of grid jobs scheduling.This helps researchers better understand the concept of scheduling, and can contribute in developing more efficient and practical scheduling algorithms.This will also benefit interested researchers to carry out further work in this dynamic research area.…”
    Get full text
    Get full text
    Get full text
    Article
  19. 19
  20. 20