Search Results - (( web application model algorithm ) OR ( job application means algorithm ))*
Search alternatives:
- application model »
- application means »
- web application »
- model algorithm »
- job application »
- means algorithm »
-
1
Fuzzy C-Mean And Genetic Algorithms Based Scheduling For Independent Jobs In Computational Grid
Published 2006“…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
Article -
2
A static jobs scheduling for independent jobs in Grid Environment by using Fuzzy C-Mean and Genetic algorithms
Published 2006Get full text
Get full text
Conference or Workshop Item -
3
-
4
-
5
A comparative representation approach to modern heuristic search methods in a job shop
Published 2008Get full text
Get full text
Citation Index Journal -
6
-
7
Web application vulnerabilities detection model
Published 2016“…The research will be carried out by using design string matching algorithm. The algorithm is used in order to match the defined criteria of each web vulnerability with the input information about web application. …”
Get full text
Get full text
Research Reports -
8
-
9
Car dealership web application
Published 2022“…The web service performed model explaining and monitoring by querying the application data from the Azure SQL Database. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
10
Cyberbullying detection: a machine learning approach
Published 2022“…Finally, the model was pickled and loaded into the web application. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
11
Multi objective bee colony optimization framework for grid job scheduling
Published 2013“…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
Conference or Workshop Item -
12
Dynamic modeling by usage data for personalization systems
Published 2009Get full text
Get full text
Conference or Workshop Item -
13
-
14
-
15
Survey on job scheduling mechanisms in grid environment
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 -
16
A web usage mining approach based on LCS algorithm in online predicting recommendation systems
Published 2008“…Online prediction is one Web Usage Mining application. However, the accuracy of the prediction and classification in the current architecture of predicting users' future requests systems can not still satisfy users especially in huge Web sites. …”
Get full text
Get full text
Article -
17
An optimized attack tree model for security test case planning and generation
Published 2018“…This paper presents an attack tree modeling algorithm for deriving a minimal set of effective attack vectors required to test a web application for SQL injection vulnerabilities. …”
Get full text
Get full text
Article -
18
-
19
Efficient DNS based Load Balancing for Bursty Web Application Traffic
Published 2012“…This research proposes a new efficient load balancing algorithm which applies to the local Domain Name Service (DNS) server for web based applications and services to ease the sudden increase in demand for the services. …”
Get full text
Get full text
Get full text
Article -
20
Checkpointing in selected most fitted resource task scheduling in grid computing
Published 2012“…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
Conference or Workshop Item