Search Results - (( simulation optimization drops algorithm ) OR ( variable classification using algorithm ))
Search alternatives:
- variable classification »
- classification using »
- optimization drops »
- using algorithm »
-
1
IWDSA: a hybrid Intelligent Water Drops with a Simulated Annealing for the localization improvement in wireless sensor networks
Published 2024“…The proposed algorithm, named Intelligent Water Drops with Simulated Annealing (IWDSA), combines two powerful optimization methods: Intelligent Water Drops (IWD) and Simulated Annealing (SA). …”
Get full text
Get full text
Get full text
Article -
2
Solving university examination timetabling problem using intelligent water drops algorithm
Published 2024Conference Paper -
3
Vehicle pick-up and drop-off schedule optimization in a university setting
Published 2024“…Lateness will be removed using a lateness waiting time rollback mechanism. A simulated annealing-based multi-directional iterative local search algorithm is employed for solution optimization. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
4
Simulated Kalman Filter algorithms for solving optimization problems
Published 2019“…In this research, two novel estimation-based metaheuristic optimization algorithms, named as Simulated Kalman Filter (SKF), and single-solution Simulated Kalman Filter (ssSKF) algorithms are introduced for global optimization problems. …”
Get full text
Get full text
Thesis -
5
Solving University Examination Timetabling Problem Using Intelligent Water Drops Algorithm
Published 2024“…IWD is a recent metaheuristic population-based algorithm belonging to swarm intelligent category which simulate river system. …”
Proceedings Paper -
6
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 -
7
Dijkstra’s Algorithm for optimal recyclable waste collection system in Port Dickson / Nur Jazlina Mohd Iszairi, Aina Zulaika Md Ramli and Nursabrina Saifulbahri
Published 2023“…A practical recyclable waste collection system would optimize the Waste Management System (WMS), especially in route choice from Depot to each drop-off collection center. …”
Get full text
Get full text
Student Project -
8
-
9
Inverse modeling of mass transferprocess in the RDC column by fuzzy approach
Published 2003“…An algorithm of the fuzzy model is developed to simulate the above process. …”
Get full text
Get full text
Book Section -
10
Optimized topology control in mobile IP networks using a new parametric routing algorithm
Published 2018“…Then, a new optimal routing algorithm is proposed to make up the node failure and changing Foreign Agent (FA). …”
Get full text
Get full text
Get full text
Article -
11
Mathematical modelling of mass transfer in a multi-stage rotating disc contactor column
Published 2005“…Based on this formulation, a Mass Transfer of A Single Drop (MTASD) Algorithm was designed, followed by a more realistic Mass Transfer of Multiple Drops (MTMD) Algorithm which was later refined to become another algorithm named the Mass Transfer Steady State (MTSS) Algorithm. …”
Get full text
Get full text
Thesis -
12
Benchmark simulator with dynamic environment for job scheduling in grid computing
Published 2014“…Characteristics of jobs and resources to be used in evaluating the performance of the scheduling algorithm must reflect the dynamic nature of real grid environment.Static models of jobs and resources cannot be used to generate jobs and resources in simulating the grid environment because of the dynamic nature of the grid.This paper presents a new graph representation of jobs and resources which is practical for hybrid metaheuristic model implementation such as ant colony optimization and genetic algorithm.A dynamic model that can generate jobs and resources similar to the jobs and resources in the real grid environment is also proposed.Jobs and resources may join in or drop out from the grid.Stochastic analysis is performed on the characteristics of jobs and resources.A simulator based on the dynamic expected time to compute, has been developed and can be used as a benchmark.The simulator can generate jobs and resources with the characteristics of jobs and resources in the real grid environment.This will facilitates the evaluation of dynamic job scheduling algorithm.…”
Get full text
Get full text
Get full text
Conference or Workshop Item -
13
Comparative study of meta-heuristics optimization algorithm using benchmark function
Published 2017“…Therefore it is necessary to compare the performance of these algorithms with certain problem type. This paper compares 7 meta-heuristics optimization with 11 benchmark functions that exhibits certain difficulties and can be assumed as a simulation relevant to the real-world problems. …”
Get full text
Get full text
Article -
14
Hybrid ACO and SVM algorithm for pattern classification
Published 2013“…Ant Colony Optimization (ACO) is a metaheuristic algorithm that can be used to solve a variety of combinatorial optimization problems. …”
Get full text
Get full text
Get full text
Thesis -
15
Enhanced Intelligent Water Drops Algorithm for University Examination Timetabling Problems
Published 2024“…The main motivations for investigating IWD algorithm are: (i) IWD has been successfully employed to solve many optimization problems. …”
thesis::doctoral thesis -
16
Classification of tropical rainforest using different classification algorithm based on remote sensing imagery: A study of Gunung Basor
Published 2019“…Thehighest accuracy for classification map of Gunung Basor is by using maximum likelihood algorithm with an accuracy of 82.90%. …”
Get full text
Get full text
Undergraduate Final Project Report -
17
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 -
18
Fair bandwidth distribution marking and scheduling algorithm in network traffic classification
Published 2019“…Finally, propose a new method of obtaining optimal parameters dropping functions for Random Early Detection (RED) algorithm. …”
Get full text
Get full text
Thesis -
19
-
20
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
