Search Results - (( web application ((bees algorithm) OR (_ algorithm)) ) OR ( job application means algorithm ))*

Task scheduling in cloud computing environment using hybrid genetic algorithm and artificial bee colony by Mohd Izuddin Sipluk

“…In this project, a comparative evaluation of selected algorithms is done to ascertain their applicability, practicality, and adaptability in a cloud scenario. …”
Get full text
Get full text
Get full text

Towards developing a web application with text filtering for FTMSK : A case study for electronic exchange board / Sumardi Shukor by Shukor, Sumardi

Get full text
Get full text

Task scheduling in cloud computing environment using hybrid genetic algorithm and bat algorithm by Muhammad Syahril Mohamad Sainal

“…Furthermore, CloudSim simulator will be used to evaluate the performance of this algorithm. The result of the algorithm performance will be appeared in web application system. …”
Get full text
Get full text
Get full text

Objects tracking from natural features in mobile augmented reality by Ng, Edmund Giap Weng, Rehman, Ullah Khan, Shahren, Ahmad Zaidi Adruce, Oon, Yin Bee

“…The pose matrix from extracted features was calculated by Homography. The adapted algorithm was tested in a mobile AR-prototype application using iPhone. …”
Get full text
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

A static jobs scheduling for independent jobs in Grid Environment by using Fuzzy C-Mean and Genetic algorithms by Lorpunmanee, Siriluck, Md. Sap, Mohd. Noor, Abdullah, Abdul Hanan, Srinoy, Surat

Get full text
Get full text

Adaptive intelligence job online scheduling within dynamic grid environment based on gridsim by Lorpunmanee, Siriluck, Md. Sap, Mohd. Noor, Abdullah, Abdul Hanan

Get full text
Get full text

A comparative representation approach to modern heuristic search methods in a job shop by Dominic P, Dhanapal Durai, Ahmad, Kamil, Parthiban, P, Lenny Koh, SC

Get full text
Get full text

Effect of adopting different dispatching rules on the mean flow time in a two machine batch-shop problem by Abdelraheem Elhaj, Hazir Farouk

Get full text
Get full text
Get full text

Application of intelligence based genetic algorithm for job sequencing problem on parallel mixed-model assembly line by Noroziroshan, Alireza, Mohd Ariffin, Mohd Khairol Anuar, Ismail, Napsiah

Get full text
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

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

Home service mobile application based on matching algorithm / Mohammad Naqib Norbaini by Norbaini, Mohammad Naqib

Get full text
Get full text

Checkpointing in selected most fitted resource task scheduling in grid computing by Latip, Rohaya, Lew, Wai San, Chanchary, Fara Habib

“…Results show that with MeanFailureCP-SMF has reduce the average execution time (AET) compare to the current SMF and MeanFailure Algorithm.…”
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

“…Hence when setup time is small more batches are formed which means fewer jobs are to be processed per batch.The proposed OCGA effectively solve the problem with better solution quality compared to other local search methods. …”
Get full text

Text Extraction Algorithm for Web Text Classification by Theab, Mustafa Muwafak

“…A text extraction prototype is built using Visual C# 2008 to validate the algorithm. It is a windows application mixed with web connection protocol. …”
Get full text
Get full text
Get full text

A dynamic replication aware load balanced scheduling for data grids in distributed environments of internet of things by Bakhshad, Said, Noor, Rafidah Md, Akhundzada, Adnan, Saba, Tanzila, Ahmedy, Ismail, Haroon, Faisal, Nazir, Babar

“…The response and average access time has been significantly decreased, thus reducing the overall mean job execution time.…”
Get full text
Get full text

Optimization of Workload Allocation Problem in a Network of Heterogeneous Computer Systems by Rahela, Abdul Rahim

“…A new algorithm of workload allocation scheme using First Come First Serve discipline in conjunction with optimization of GE queueing systems is proposed for minimizing mean queue length and mean response time in a network of computer systems. …”
Get full text
Get full text
Get full text

Dynamic replication aware load blanced scheduling in distributed environment / Said Bakhshad by Said Bakhshad, Bakhshad

“…We propose a novel dynamic Replication Aware Load Balanced Scheduling (DRALBS) algorithm, that considers the replica location dynamically at the time of the scheduling of the job. …”
Get full text
Get full text
Get full text

A new algorithm to measure relevance among Web pages by Sadi, M.S., Rahman, M.M. Hafizur, Horiguchi, Susumu

“…To evaluate the performance, the algorithm is compared with existing algorithms. Experimental results show that RWP outperforms existing algorithms to find relevant Web pages. …”
Get full text
Get full text
Get full text