Search Results - (( processes optimization sensor algorithm ) OR ( parallel evaluation method algorithm ))

Refine Results
  1. 1

    Online teleoperation of writing manipulator through graphics processing unit based accelerated stereo vision by Abu Raid, Fadi Imad Osman

    Published 2021
    “…These algorithms are then parallelized using Compute Unified Device Architecture CUDA C language to run on Graphics Processing Unit GPU for hardware acceleration. …”
    Get full text
    Get full text
    Thesis
  2. 2

    Parallel Execution of Runge-Kutta Methods for Solving Ordinary Differential Equations by Siri, Zailan

    Published 2004
    “…The method used here is actually have been tailored made for the purpose of parallel machine where the subsequent functions evaluations do not depend on the previous function evaluations. …”
    Get full text
    Get full text
    Thesis
  3. 3

    Parallel algorithms for numerical simulations of EHD ion-drag micropump on distributed parallel computing systems by Shakeel Ahmed, Kamboh

    Published 2014
    “…To implement the parallel algorithms a distributed parallel computing laboratory using easily available low cost computers is setup. …”
    Get full text
    Get full text
    Thesis
  4. 4

    Global optimization method for continuous - Time sensor scheduling by Woon, Siew Fang, Rehbock, Volker, Loxton, Ryan C.

    Published 2010
    “…We consider a situation in which several sensors are used to collect data for signal processing since operating multiple sensors simultaneously canses system interference, only one sensor can be active at any one time.The problem of scheduling a discrete-valued optimal control problem.This problem cannot be solved using conventional optimization problem.The Transformed problem is then decomposed into a bi-level optimization problem, which is solved using a discreate filled function method in conjunction with a conventional optimal control algorithm.Numerical results show that our algorithm is robust, efficient, and reliable in attaining a near globally optimal solution.…”
    Get full text
    Get full text
    Get full text
    Article
  5. 5
  6. 6

    Enhancing performance of XTS cryptography mode of operation using parallel design by Ahmed Alomari, Mohammad

    Published 2009
    “…In addition, the parallel XTS mode was also simulated using Twofish and RC6 encryption algorithms. …”
    Get full text
    Get full text
    Thesis
  7. 7

    Parallel execution of diagonally implicit Runge-Kutta methods for solving IVPs. by Ismail, Fudziah, Siri, Zailan, Othman, Mohamad, Suleiman, Mohamed

    Published 2009
    “…Diagonally Implicit Runge-Kutta (DIRK) methods are amongst the most useful and cost-effective methods for solving initial value problems but the dependency of the functions evaluations on the previous functions evaluations makes DIRK method not so favourable for parallel computers. …”
    Get full text
    Get full text
    Article
  8. 8

    Adaptive Algorithm for Optimal Route Configuration in Multi-Hop Wireless Sensor Network by Shabani, Hikma, Ahmed Mohamed, Ahmed Haidar, Norhuzaimin, Julai, Musse, Mohamud Ahmed, Hoole, P.R.P., Marai, Majdi

    Published 2017
    “…This paper proposes an optimal route configuration technique based on an adaptive genetic algorithm in which the architecture of multi-hop wireless sensor network is considered as a distributed computing infrastructure. …”
    Get full text
    Get full text
    Get full text
    Article
  9. 9

    An energy-efficient spectrum-aware reinforcement learning-based clustering algorithm for cognitive radio sensor networks by Mustapha, Ibrahim, Mohd Ali, Borhanuddin, A. Rasid, Mohd Fadlee, Sali, Aduwati, Mohamad, Hafizal

    Published 2015
    “…We first model the network energy consumption and then determine the optimal number of clusters for the network. The problem of selecting an optimal cluster is formulated as a Markov Decision Process (MDP) in the algorithm and the obtained simulation results show convergence, learning and adaptability of the algorithm to dynamic environment towards achieving an optimal solution. …”
    Get full text
    Get full text
    Get full text
    Article
  10. 10

    Metaheuristic optimization techniques for localization in outdoor wireless sensor networks: a comprehensive review by Gumaida, Bassam, Ibrahim, Adamu Abubakar

    Published 2025
    “…These networks typically consist of hundreds to thousands of sensor nodes deployed across the target area. Each sensor node is responsible for collecting specific data and transmitting it to the processing center. …”
    Get full text
    Get full text
    Get full text
    Get full text
    Article
  11. 11

    Virtual Force Algorithm and Cuckoo Search algorithm for node placement technique in wireless sensor network by Ahmad, Puteri Azwa, Mahmuddin, Massudi, Omar, Mohd Hasbullah

    Published 2013
    “…Wireless Sensor Network (WSN) has become one of the current technologies in the world of information technology.Coverage and connectivity are the main requirement that reflects the performance and quality of services in WSN applications.In WSN applications with a large scale area, the sensor nodes are deployed randomly in a noninvasive way.The deployment process will cause some issues such as coverage hole and overlapping that reflect to the performance of coverage area and connectivity.Node placement model is constructed to find the optimal node placement.Virtual Force Algorithm (VFA) and Cuckoo Search (CS) algorithm approach for node placement technique is analyzed to find the optimal node placement in order to improve the network coverage and connectivity with a minimum coverage hole and overlapping area.…”
    Get full text
    Get full text
    Get full text
    Conference or Workshop Item
  12. 12

    Whale optimization algorithm based on tent chaotic map for feature selection in soft sensors by AlRijeb, Mothena Fakhri Shaker, Othman, Mohammad Lutfi, Ishak, Aris, Hassan, Mohd Khair, Albaker, Baraa Munqith

    Published 2025
    “…One of the powerful optimization algorithms that is used for feature selection is the Whale Optimization Algorithm (WOA), which is a nature-inspired metaheuristic optimization algorithm that mimics the social behavior of humpback whales. …”
    Get full text
    Get full text
    Get full text
    Article
  13. 13

    Communication and computational cost on parallel algorithm of PDE elliptic type by Alias, Norma

    Published 2009
    “…Due to this needs, this paper presents the parallel performance evaluations of algorithms that will be discussed in term of communication and computational cost.…”
    Get full text
    Get full text
    Book Section
  14. 14

    An improved gbln-pso algorithm for indoor localization problem in wireless sensor network by Muhammad Shahkhir, Mozamir

    Published 2022
    “…Then, we compared the result with Particle Swarm Optimization (PSO), Differential Evolution Particle Swarm Optimization (DEPSO), Health Particle Swarm Optimization (HPSO) and Global best Local Neigborhood Particle Swarm Optimization (GbLN-PSO) algorithm. …”
    Get full text
    Get full text
    Thesis
  15. 15

    Delay and energy-aware routing for efficient data collection in wireless sensor networks / Ihsan Ali by Ihsan , Ali

    Published 2024
    “…The AFW algorithm reduces unnecessary computations by focusing only on useful edge entries in the graph, thereby expediting the optimization process. …”
    Get full text
    Get full text
    Get full text
    Thesis
  16. 16

    Improved GbLN-PSO Algorithm for indoor localization in wireless sensor network by M. Shahkhir, Mozamir, Rohani, Abu Bakar, Wan Isni Soffiah, Wan Din, Zalili, Musa

    Published 2021
    “…To compass this problem, an Improved Global best Local Neighborhood Particle Swarm Optimization (IGbLN-PSO) algorithm has been proposed. …”
    Get full text
    Get full text
    Get full text
    Article
  17. 17
  18. 18

    Analysis of evolutionary computing performance via mapreduce parallel processing architecture / Ahmad Firdaus Ahmad Fadzil by Ahmad, Ahmad Firdaus

    Published 2014
    “…MR is an emerging parallel processing framework that hides the complex parallelization processes by employing the functional abstraction of "map and reduce" The Performance of the parallelized GA via MR and PSO via MR are evaluated using an analogous case study to find out the speedup and efficiency in order to measure the scalability of both proposed algorithms. …”
    Get full text
    Get full text
    Thesis
  19. 19
  20. 20