Search Results - (( job application ((need algorithm) OR (bees algorithm)) ) OR ( _ application sensor algorithm ))*

Deploying clustered wireless sensor network by multi-robot system by Arezoumand, Reza, Mashohor, Syamsiah

“…Deployment strategy is vital for efficiency in applications of wireless sensor network. Deploying wireless sensor network in vast area is very hard and time consuming job. …”
Get full text
Get full text

Multi objective bee colony optimization framework for grid job scheduling by Alyaseri, Sana, Ku-Mahamud, Ku Ruhana

“…Grid computing is the infrastructure that involves a large number of resources like computers, networks and databases which are owned by many organizations.Job scheduling problem is one of the key issues because of high heterogeneous and dynamic nature of resources and applications in the grid computing environment.Bee colony approach has been used to solve this problem because it can be easily adapted to the grid scheduling environment.The bee algorithms have shown encouraging results in terms of time and co st.In this paper a framework for multi objective bee colony optimization is proposed to schedule batch jobs to available resources where the number of jobs is greater than the number of resources.Pareto analysis and k-means analysis are integrated in the bee colony optimization algorithm to facilitate the scheduling of jobs to resources.…”
Get full text
Get full text
Get full text

Shape-Based Matching: Application of Defect Detection by Harun, Mohamad Haniff, Sulaiman , Marizan, Hairol Nizam , Mohd Shah

“…This research is regarding to the application of a vision algorithm sensor to monitor the operation of a system in order to control the concerning jobs and work pieces recognition that are to be made during system operation in real time. …”
Get full text
Get full text
Get full text

Comparison Between the Bees Algorithm and Genetic Algorithm Model in Manpower Allocation on Cell Loading Problem by AlMahasneh, Hossam Sayel

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

Bee foraging behaviour techniques for grid scheduling problem by Alyaseri, Sana, Ku-Mahamud, Ku Ruhana

“…Grid computing is the infrastructure that involves a large number of resources like computers, networks and databases which are owned by many organizations.These resources are collected together to make a huge computing power.Job scheduling problem is one of the key issues in grid computing and failing to look into grid scheduling results in uncompleted view of the grid computing.Achieving optimized performance of grid system, and matching application requirements with available computing resources, are the objectives of grid job scheduling.Bee colony approaches are more adaptive to grid scheduling due to high heterogeneous and dynamic nature of resources and applications in grid.These algorithms have shown encouraging results in terms of time and cost.This paper presents some resent research activities inspired by bee foraging behavior for grid job scheduling especially ABC and BCO approaches.Different original studies related to this area are briefly described along with their comparisons against them and results.The review summary of their derived algorithms and research efforts is done.…”
Get full text
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

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

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

Job recruiting system using sorting Algorithm / Adi Asyraf Ayob by Ayob, Adi Asyraf

“…The sorting algorithm will assist the recruiters in selecting best job candidate by assigning score to each applicants and sort the applicant list by the finest score value. …”
Get full text
Get full text

Optimisation of energy efficient hybrid flowshop scheduling problem using firefly algorithm by M. F. F., Ab Rashid, Mohd Abdul, Hadi Osman

Get full text
Get full text
Get full text

Impatient job scheduling under cloud computing by Mahdi, Nawfal A.

“…The limitations of those algorithms were addressed and this leads to the proposition of an algorithm that has the ability to map the impatient jobs to virtual machines near its input, output, application, or forth party. …”
Get full text
Get full text

Resource management in grid computing using enhanced ant colony optimization by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza, Abdul Nasir, Husna Jamal

Get full text
Get full text

INCENTIVE-SCHEDULING ALGORITHMS TO PROVIDE GREEN COMPUTATIONAL DATA CENTER by HARUNA, AHMED ABBA

Get full text
Get full text

Enhanced ant colony optimization for grid resource scheduling by Abdul Nasir, Husna Jamal, Ku-Mahamud, Ku Ruhana

Get full text
Get full text

A survey of state of the art: hierarchical routing algorithms for wireless sensor networks by Kareem, Husam, Hashim, Shaiful Jahari, Sali, Aduwati, Subramaniam, Shamala

“…Wireless sensor networks can be used in wide range of applications such as measuring temperature, humidity, pressure, noise level, monitoring the vehicular movement, military applications and health applications. …”
Get full text
Get full text
Get full text

Efficient k-coverage scheduling algorithms for wireless sensor networks / Ahmed Abdullah Saleh Al-Shalabi by Saleh Al-Shalabi, Abdullah

“…An efficient k-coverage algorithm for sensors with fixed sensing range (Maximum Layers Scheduling algorithm - MLS) is demonstrated. …”
Get full text
Get full text

Wireless sensor nodes deployment using multi-robot based on improved spanning tree algorithm by Arezoumand, Reza

“…By merging wireless sensor nodes with mobile robots, the performance of wireless sensor network applications may be improved. …”
Get full text
Get full text

Distance vector-hop range-free location algorithm for wireless sensor network by Zazali, Azyyati Adiah

Get full text
Get full text

Development of an algorithm for correlation of aircraft positioning data from radar and ADS-B sensors / Koh Che Hun by Koh , Che Hun

Get full text
Get full text
Get full text