Search Results - (( _ application ((tools algorithm) OR (drops algorithm)) ) OR ( job application need algorithm ))*

IWDSA: a hybrid Intelligent Water Drops with a Simulated Annealing for the localization improvement in wireless sensor networks by Gumaida, Bassam, Ibrahim, Adamu Abubakar

Get full text
Get full text
Get full text

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

“…All the three proposed algorithms are evaluated using discrete event simulation, in particular Network Simulator tool (NS2), and compared with the latest routing algorithm (NCPR ) and fundamental algorithm (AODV) using five performance metrics. …”
Get full text
Get full text
Get full text

A genetic algorithm to minimise the maximum lateness on a single machine family scheduling problem by Lee, Lai Soon, Nazif, Habibeh

“…In the case of large setup time, jobs tend to form a large batch size with more jobs in a batch to reduce the need of setup time between batches from different families. …”
Get full text

Mathematical modelling of mass transfer in a multi-stage rotating disc contactor column by Maan, Normah

Get full text
Get full text

Dropping down the maximum item set: improving the stylometric authorship attribution algorithm in the text mining for authorship investigation by Mustafa, Tareef Kamil, Mustapha, Norwati, Azmi Murad, Masrah Azrifah, Sulaiman, Md. Nasir

Get full text
Get full text

Comparative study of meta-heuristics optimization algorithm using benchmark function by Ismail, I., Halim, A.H.

“…Meta-heuristics optimization is becoming a popular tool for solving numerous problems in real-world application due to the ability to overcome many shortcomings in traditional optimization. …”
Get full text
Get full text

Adaptive artificial neural network for power system security assessment and control action by Al-Masri, Ahmed Naufal A.

“…This study also investigates the reliability of ANN application in power system security assessment in terms of accuracy and computational time as well as developing a new method that can be included in security assessment tools. …”
Get full text
Get full text

TDMA scheduling analysis of energy consumption for iot wireless sensor network by Islam, Md Ashikul

“…The algorithm use time division multiplexing algorithm together with hello message to allocate the neighbors and their energy level to find the best way to communicate and reduce packet drop, less signal interference and increase throughput. …”
Get full text
Get full text

DEVELOPMENT AND TESTING OF UNIVERSAL PRESSURE DROP MODELS IN PIPELINES USING ABDUCTIVE AND ARTIFICIAL NEURAL NETWORKS by AYOUB MOHAMMED, MOHAMMED ABDALLA

“…It was found that (by the Group Method of Data Handling algorithm), length of the pipe, wellhead pressure, and angle of inclination have a pronounced effect on the pressure drop estimation under these conditions. …”
Get full text
Get full text

Independent And Dependent Job Scheduling Algorithms Based On Weighting Model For Grid Environment by M. Al-Najjar, Hazem

Get full text
Get full text

A new method of correcting uneven illumination problem in fundus images by Aibinu, Abiodun Musa, Iqbal, Muhammad Imran, Nilsson, Mikael, Salami, Momoh Jimoh Emiyoka

Get full text
Get full text

Fuzzy C-Mean And Genetic Algorithms Based Scheduling For Independent Jobs In Computational Grid by Lorpunmanee, Siriluck, Md Sap, Mohd Noor, Abdullah, Abdul Hanan

“…Our model presents the method of the jobs classifications based mainly on Fuzzy C-Mean algorithm and mapping the jobs to the appropriate resources based mainly on Genetic algorithm. …”
Get full text
Get full text

Review on unrelated parallel machine scheduling problem with additional resources by Abed, Munther H., Mohd Nizam, Mohmad Kahar

“…UPMR consists of scheduling a set of jobs on unrelated machines. In addition to that, a number of one or more additional resources are needed. …”
Get full text
Get full text
Get full text

Network Traffic Classification Analysis on Differentiated Services Code Point Using Deep Learning Models for Efficient Deep Packet Inspection by Ahmed Khan, Fazeel, Abubakar, Adamu

Get full text
Get full text
Get full text

Tumor growth prediction using parallel computing: numerical solutions based on multi-dimensional partial differential equation (PDE) by Alias, Norma, Islam, Md. Rajibul

Get full text
Get full text
Get full text
Get full text

High Viscous Fluid Transport Model by Tan, Ming Chai

Get full text
Get full text

Optimisation of distributed generation in electric power systems using fuzzy-genetic algorithm approach by Akorede, Mudathir Funsho

Get full text
Get full text

Bottleneck-based heuristic for permutation flowshop scheduling by Isa, Noor Amira

“…A total 1000 set random processing time for each job sizes was tested using Excel simple programming with built in Visual Basic for Application (VBA). …”
Get full text
Get full text
Get full text
Get full text

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

“…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

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

“…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