Search Results - (( variable presentations _ algorithm ) OR ( java application during algorithm ))
Search alternatives:
- application during »
- java application »
- during algorithm »
- variable »
-
1
SUDOKU HELPER
Published 2015“…In this paper research, author presents an algorithm to provide a tutorial for any Sudoku player who got stuck during the solving process. …”
Get full text
Get full text
Final Year Project -
2
An efficient method for determining all the extreme points of function with one variable
Published 2014“…An algorithm for determining all the extreme and inflection points to one variable multi-modal global optimization problems is presented. …”
Get full text
Thesis -
3
Talkout : Protecting mental health application with a lightweight message encryption
Published 2022“…The investigation of lightweight message encryption algorithms is conducted with systematic quantitative literature and experiment implementation in Java and Android running environment. …”
Get full text
Get full text
Get full text
Academic Exercise -
4
Mine blast algorithm for optimization of truss structures with discrete variables
Published 2012“…In this study a novel optimization method is presented, the so called mine blast algorithm (MBA). …”
Get full text
Article -
5
General Algorithm of n-Multiple Coil Shape for Variable Links Hyper-Redundant Robotic Manipulator
Published 2011“…In this paper, a general algorithm for n-links hyper-redundant robot manipulator to produce n-multiple coil shape to reach final desired position with variable links is presented. …”
Get full text
Get full text
Get full text
Proceeding Paper -
6
Mixed-variable ant colony optimisation algorithm for feature subset selection and tuning support vector machine parameter
Published 2017“…This paper presents a hybrid classification algorithm, ACOMV-SVM which is based on ant colony and support vector machine.A new direction for ant colony optimisation is to optimise mixed (discrete and continuous) variables.The optimised variables are then feed into selecting feature subset and tuning its parameters are two main problems of SVM.Most approaches related to tuning support vector machine parameters will discretise the continuous value of the parameters which will give a negative effect on the performance. …”
Get full text
Get full text
Article -
7
Optimization Of Bar Linkage By Using Genetic Algorithms
Published 2005“…This thesis presents the method of using simple Genetic Algorithms (GAs) in optimizing the size of bar linkage with discrete design variables and continues design variables. …”
Get full text
Get full text
Monograph -
8
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 -
9
Dynamic Bayesian networks and variable length genetic algorithm for designing cue-based model for dialogue act recognition
Published 2010“…In the second stage, the developed variable length genetic algorithm is used to select different sets of lexical cues to constitute the dynamic Bayesian networks' random variables. …”
Get full text
Get full text
Article -
10
Adapting the Elitism on the Greedy Algorithm for Variable Strength Combinatorial Test Cases Generation
Published 2018“…In recent times, many researchers had developed the various strategies based on the search-based approach to address the combinatorial testing issues. This study presented the most recent variable interaction strength (VS) CT strategy using an enhanced variant in the greedy algorithm. …”
Get full text
Get full text
Get full text
Article -
11
An algorithm for pulsed activation of solenoid valves for variable rate application of agricultural chemicals
Published 2008Get full text
Get full text
Conference or Workshop Item -
12
Fault diagnostic algorithm for precut fractionation column
Published 2004“…This paper presents an algorithm which can be used to detect and diagnose unexpected process faults in the operation of fatty acid precut fractionation column. …”
Get full text
Get full text
Conference or Workshop Item -
13
-
14
Cuckoo search algorithm as an optimizer for optimal reactive power dispatch problems
Published 2017“…This paper presents the application of Cuckoo Search Algorithm (CSA) in optimizing the control variables of power system operation in solving the optimal reactive power dispatch (ORPD) problem. …”
Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
15
-
16
Metaheuristics for the waste collection vehicle routing problem with time windows
Published 2010“…In this problem there is a set of customers which waste is collected by vehicles.Vehicles can visit waste disposal facilities during their working day to empty collected waste and hence continue to collect from customers.The vehicles start and end their routes at a single depot empty.We take into consideration time windows associated with customers, disposal facilities and the depot.Here, we also have a driver rest period.The problem is solved using a number of metaheuristic algorithms namely tabu search (TS) and variable neighbourhood search (VNS).More over, we also present a combined metaheuristic algorithm based on variable neighbourhood tabu search (VNTS).Where the variable neighbourhood is searched via tabu search.Computational experiments on ten publicly available waste collection benchmark problems involving up to 2092 customers and 19 waste disposal facilities indicates that the proposed algorithms are able to find better quality solutions than previous work presented in literature within reasonable computation times.…”
Get full text
Get full text
Conference or Workshop Item -
17
-
18
-
19
Study of nature inspired computing (NIC) technique for optimal reactive power dispatch problems
Published 2017“…ORPD problem is a nonlinear optimization problem that involving both equality constraints and inequality constraints. The proposed algorithms are tested on five different case studies which are IEEE 30-bus system with 13 control variables, IEEE 30-bus system with 19 control variables, IEEE 30-bus system with 25 control variables, IEEE 57-bus system with 25 control variables and IEEE 118-bus system with 77 control variables. …”
Get full text
Get full text
Research Report -
20
New selection algorithm for Mengubah Destini Anak Bangsa (MDAB) students / Zamali Tarmudi ... [et al.]
Published 2014“…Finally, our new proposed algorithm and modification of the variables can derive more precise in terms of representing the actual situation.…”
Get full text
Get full text
Research Reports