Search Results - (( based evaluation mead algorithm ) OR ( time generation based algorithm ))*
Search alternatives:
- based evaluation »
- generation based »
- evaluation mead »
- time generation »
- mead algorithm »
-
1
-
2
A Novel Polytope Algorithm based on Nelder-mead method for localization in wireless sensor network
Published 2024“…Results: Simulation results perfectly showed that the suggested localization algorithm based on NMM can carry out a better performance than that of other localization algorithms utilizing other op- timization approaches, including a particle swarm optimization, ant colony (ACO) and bat algorithm (BA). …”
Get full text
Get full text
Get full text
Get full text
Article -
3
-
4
Optimized PID controller of DC-DC buck converter based on archimedes optimization algorithm
Published 2023“…The proposed PID controller, optimized using AOA, is contrasted with PID controllers tuned via alternative algorithms including the hybrid Nelder-Mead method (AEONM), artificial ecosystem-based optimization (AEO), differential evolution (DE), and particle swarm optimizer (PSO). …”
Get full text
Get full text
Get full text
Article -
5
Single and Multiple variables control using Tree Physiology Optimization
Published 2017“…The proposed algorithm is also compared with deterministic gradient-free algorithm: Nelder-Mead simplex (NMS) and another metaheuristic algorithm: Particle Swarm Optimization (PSO). …”
Get full text
Get full text
Article -
6
Sudoku Generator based on hybrid algorithm / Faridah Abdul Rahman
Published 2012“…The objectives this research are to investigate hybrid algorithm in game generator, to develop Sudoku generator based on hybrid algorithm and lastly to test and evaluate the Sudoku generator using time comparison. …”
Get full text
Get full text
Thesis -
7
Multiple case-based retrieval for university course timetabling problem
Published 2016“…Results from the experiments show the effectiveness and elapsed time to generate a timetable. Multiple Case-based Retrieval shows promising results in improving the effectiveness of case-based retrieval and also reduced the time required to generate a new timetable. …”
Get full text
Get full text
Thesis -
8
A matlab-based graphical user interface (GUI) to predict the food quality during frying process
Published 2022“…The colour and moisture content were evaluated based on two parameters of French fries, which were oil temperature (150℃,170℃ and 190℃) and sample thickness (5mm,10mm and 15mm) during deep frying. …”
Get full text
Thesis -
9
Contour generation for mask projection stereolithography 3D printing
Published 2019“…In an effort to reduce the computational time, a new and faster algorithm is required. Thus, a real-time contour generation algorithm is presented in this research. …”
Get full text
Get full text
Thesis -
10
Stereolithography 3D printing development of 3D printing machine controller using the predefined closest-distance volume interpolator system
Published 2019“…In an effort to reduce the computational time, a new and faster algorithm is required. Thus, a real-time contour generation algorithm is presented in this research. …”
Get full text
Get full text
Research Report -
11
An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion
Published 2018“…Performance of each algorithm is compared in terms of number of test cases generated as well as the run time required. …”
Get full text
Get full text
Thesis -
12
A hybrid kidney algorithm strategy for combinatorial interaction testing problem
Published 2022“…HKAS is the first hybrid metaheuristic-based CIT strategy that generates an optimum FTS size with less execution time than the original algorithm-based CIT strategy. …”
Get full text
Get full text
Thesis -
13
A permutation parallel algorithm under exchange restriction with message passing interface
Published 2014“…However permutation generation is time consuming process, the implementation of sequential algorithm to parallel computation is the option for reducing the computation time. …”
Get full text
Get full text
Conference or Workshop Item -
14
An improved Levenshtein algorithm for spelling correction word candidate list generation
Published 2016“…The most widely used algorithm for generating candidates’ list for incorrect words is based on Levenshtein distance. …”
Get full text
Get full text
Get full text
Thesis -
15
MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD
Published 2023“…Then, the results of machining time that used the tool path generated by the Ant Colony algorithm method was compared with the machining time that used tool paths generated by conventional methods. …”
Get full text
Get full text
Article -
16
MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD
Published 2023“…Then, the results of machining time that used the tool path generated by the Ant Colony algorithm method was compared with the machining time that used tool paths generated by conventional methods. …”
Get full text
Get full text
Article -
17
MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD
Published 2023“…Then, the results of machining time that used the tool path generated by the Ant Colony algorithm method was compared with the machining time that used tool paths generated by conventional methods. …”
Get full text
Get full text
Article -
18
MINIMIZATION OF MACHINING PROCESS SEQUENCE BASED ON ANT COLONY ALGORITHM AND CONVENTIONAL METHOD
Published 2023“…Then, the results of machining time that used the tool path generated by the Ant Colony algorithm method was compared with the machining time that used tool paths generated by conventional methods. …”
Get full text
Get full text
Article -
19
A frequent pattern mining algorithm based on FP-growth without generating tree
Published 2010“…In this paper we introduce an algorithm to generate frequent patterns without generating a tree and therefore improve the time complexity and memory complexity as well. …”
Get full text
Get full text
Conference or Workshop Item -
20
A frequent pattern mining algorithm based on FP-growth without generating tree
Published 2010“…It then divides the compressed database into a set of conditional databases (a special kind of projected database), each associated with one frequent item or pattern fragment, and mines each such database separately.For a large database, constructing a large tree in the memory is a time consuming task and increase the time of execution.In this paper we introduce an algorithm to generate frequent patterns without generating a tree and therefore improve the time complexity and memory complexity as well.Our algorithm works based on prime factorization, and is called Frequent Pattern- Prime Factorization (FPPF).…”
Get full text
Get full text
Get full text
Conference or Workshop Item
