Search Results - (( java application scheduling algorithm ) OR ( variables classification modeling algorithm ))
Search alternatives:
- variables classification »
- classification modeling »
- application scheduling »
- modeling algorithm »
- java application »
-
1
Performance evaluation of real-time multiprocessor scheduling algorithms
Published 2016“…The CPU profiler of JavaTM VisualVM measures the number of invocations of scheduling event handlers (procedures) in each algorithm as well as the total time spent in all invocations of this handler. …”
Get full text
Get full text
Conference or Workshop Item -
2
A Toolkit for Simulation of Desktop Grid Environment
Published 2014“…In this type of environment it is nearly impossible to prove the effectiveness of a scheduling algorithm. Hence the main objective of this study is to develop a desktop grid simulator toolkit for measuring and modeling scheduler algorithm performance. …”
Get full text
Get full text
Final Year Project -
3
Classification for large number of variables with two imbalanced groups
Published 2020“…This study proposed two algorithms of classification namely Algorithm 1 and Algorithm 2 which combine resampling, variable extraction, and classification procedure. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Thesis -
4
Computer Lab Timetabling Using Genetic Algorithm Case Study - Unit ICT
Published 2006“…Genetic Algorithm is one of the most popular optimization solutions used in various applications such as scheduling. …”
Get full text
Get full text
Thesis -
5
Formulating new enhanced pattern classification algorithms based on ACO-SVM
Published 2013“…ACO originally deals with discrete optimization problem.In applying ACO for solving SVM model selection problem which are continuous variables, there is a need to discretize the continuously value into discrete values.This discretization process would result in loss of some information and hence affects the classification accuracy and seeking time.In this algorithm we propose to solve SVM model selection problem using IACOR without the need to discretize continuous value for SVM.The second algorithm aims to simultaneously solve SVM model selection problem and selects a small number of features.SVM model selection and selection of suitable and small number of feature subsets must occur simultaneously because error produced from the feature subset selection phase will affect the values of SVM model selection and result in low classification accuracy.In this second algorithm we propose the use of IACOMV to simultaneously solve SVM model selection problem and features subset selection.Ten benchmark datasets were used to evaluate the proposed algorithms.Results showed that the proposed algorithms can enhance the classification accuracy with small size of features subset.…”
Get full text
Get full text
Get full text
Article -
6
Improving Class Timetabling using Genetic Algorithm
Published 2006“…This paper reports the power fill techniques using GA in scheduling. Class timetabling problem is one of the applications in scheduling. …”
Get full text
Get full text
Get full text
Thesis -
7
Examination timetabling using genetic algorithm case study: KUiTTHO
Published 2005“…This paper reports the powerful techniques using GA in scheduling. Examination timetabling problem is one of the applications in scheduling. …”
Get full text
Get full text
Thesis -
8
Examination Timetabling Using Genetic Algorithm Case Study : KUiTTHO
Published 2005“…This paper reports the powerful techniques using GA in scheduling. Examination timetabling problem is one of the applications in scheduling. …”
Get full text
Get full text
Get full text
Thesis -
9
Feature selection and model selection algorithm using incremental mixed variable ant colony optimization for support vector machine classifier
Published 2013“…In order to enhance SVM performance, these problems must be solved simultaneously because error produced from the feature subset selection phase will affect the values of the SVM parameters and resulted in low classification accuracy.Most approaches related with solving SVM model selection problem will discretize the continuous value of SVM parameters which will influence its performance.Incremental Mixed Variable Ant Colony Optimization (IACOMV) has the ability to solve SVM model selection problem without discretising the continuous values and simultaneously solve the two problems.This paper presents an algorithm that integrates IACOMV and SVM.Ten datasets from UCI were used to evaluate the performance of the proposed algorithm.Results showed that the proposed algorithm can enhance the classification accuracy with small number of features.…”
Get full text
Get full text
Get full text
Article -
10
Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection
Published 2022“…Therefore, in this paper, we proposed Dynamic tasks scheduling algorithm based on attribute reduction with an enhanced hybrid Genetic Algorithm and Particle Swarm Optimization for optimal device selection. …”
Get full text
Get full text
Article -
11
-
12
Batch mode heuristic approaches for efficient task scheduling in grid computing system
Published 2016“…Many algorithms have been implemented to solve the grid scheduling problem. …”
Get full text
Get full text
Get full text
Thesis -
13
Mixed variable ant colony optimization technique for feature subset selection and model selection
Published 2013Get full text
Get full text
Get full text
Conference or Workshop Item -
14
Development of a syncope classification algorithm from physiological signals acquired in tilt-table test
Published 2023“…There are 8 set of feature selection model has built and a total of 24 set of classifiers with 3 different type of classification techniques were developed. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
15
Empirical Analysis of Intra vs. Inter-Subject Variability in VR EEG-Based Emotion Modelling
Published 2018“…Secondly, the data will then be tested and trained with KNN and SVM algorithms. We conduct subject-dependent as well as subject-independent classifications in order to compare intra-against inter-subject variability, respectively in VR EEG-based emotion modeling. …”
Get full text
Get full text
Get full text
Article -
16
-
17
New Algorithm of Location Model based on Robust Estimators and Smoothing Approach
Published 2017Get full text
Get full text
Get full text
Conference or Workshop Item -
18
Classroom finder system with student availability, space and time constraint
Published 2024Get full text
Get full text
Final Year Project / Dissertation / Thesis -
19
Application of Decision Trees in Athlete Selection: A Cart Algorithm Approach
Published 2023“…This study investigates the application of Decision Trees (DTs), a non-parametric supervised learning method, renowned for its simplicity, interpretability, and wide applicability in various domains, including machine learning for classification and regression tasks. The focus of this study is on the use of DTs, employing the Classification and Regression Trees (CART) algorithm, in the initial screening of athletes. …”
Get full text
Get full text
Get full text
Article -
20
Using fuzzy association rule mining in cancer classification
Published 2011“…Interpretability of the model, which is developed by fuzzy rules and linguistic variables in this study, has been rarely considered. …”
Get full text
Get full text
Article
