Search Results - (( developing slightly optimization algorithm ) OR ( java implication based algorithm ))
Search alternatives:
- developing slightly »
- implication based »
- java implication »
-
1
A Descent Three-Term Conjugate Gradient Direction For Problems Of Unconstrained Optimization With Application
Published 2026“…One algorithm is more robust and slightly faster than the rest. …”
preprint -
2
Development of two matheuristics for production-inventory-distribution routing problem / Dicky Lim Teik Kyee
Published 2018“…Whilst in MatHeuristic2, we adopt a slightly different approach. The algorithm starts with the pre-processing stage where the routes are determined to act as input to the MIP in Phase 1. …”
Get full text
Get full text
Get full text
Thesis -
3
Higher desirability in solving multiple response optimization problems with committee machine
Published 2014“…Committee machine (CM) as a set of some experts such as some artificial neural networks (ANNs) in combination with genetic algorithm (GA) is applied for modeling and optimization of MRO problems. …”
Get full text
Get full text
Get full text
Article -
4
LASSO-type estimations for threshold autoregressive and heteroscedastic time series models.
Published 2020“…For the reformulated model, our group LASSO definition has lower prediction errors compared to the standard group LASSO definition. We develop an active-set based block coordinate descent algorithm (BCD) to optimize exactly the group LASSO. …”
Get full text
Get full text
UMK Etheses -
5
-
6
Lexicon-based and immune system based learning methods in Twitter sentiment analysis
Published 2016“…In future work, the accuracy of proposed model can be strengthened by comparative study with other heuristic based searching algorithms such as genetic algorithm, ant colony optimization, swam algorithms and etc.…”
Get full text
Get full text
Get full text
Conference or Workshop Item -
7
Some Metaheuristics for Tourist Trip Design Problem
Published 2023“…We have built two metaheuristic algorithms based on the proposed approach, which are Genetic Algorithm (GA) and another is Ant Colony Optimization (ACO). …”
Get full text
Get full text
Conference or Workshop Item -
8
Mobile First-Person Shooter (FPS) Game Using Basic Theta* Algorithm / Muhammad Syurahbil Abd Rohaman
Published 2020“…The most common pathfinding algorithm used in video game is A*. Even though A* is the most popular algorithm amongst game developers, it's hardly the best algorithm in finding the true shortest path. …”
Get full text
Get full text
Thesis -
9
PV fault classification: Impact on accuracy performance using feature extraction in random-forest cross validation algorithm
Published 2024“…While in testing the algorithm, it effectively detected multiple fault types, especially OCF and PS, with a perfect score and slightly lower yet high accuracies for GF. …”
Get full text
Get full text
Get full text
Article -
10
Development of an integrated scheduling model for handling equipment in automated port container terminals
Published 2014“…In addition, results proved that the modified meta-heuristic algorithm is able to find near optimal solutions and on average, the solutions found by the GA algorithm are only 0.2% worse than the optimal solutions and in the worst case in the test cases this difference is 2.3% which is acceptable. …”
Get full text
Get full text
Thesis -
11
Development of compound clustering techniques using hybrid soft-computing algorithms
Published 2006“…The hierarchical fuzzy clustering algorithm developed in this work assign the overlapping structures (structures having more than one activity) to more than one clusters if their fuzzy membership values are significantly high for those clusters. …”
Get full text
Get full text
Monograph -
12
-
13
The application of metaheuristics in network routing and inventory routing problem / Huda Zuhrah Ab Halim
Published 2012“…An enhanced GA and VNS were developed and both algorithms were tested on small, medium and large problems. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Get full text
Thesis -
14
Digital Quran With Storage Optimization Through Duplication Handling And Compressed Sparse Matrix Method
Published 2024thesis::doctoral thesis -
15
Deep Learning-Driven Mobility And Utility-Based Resource Management In Mm-Wave Enable Ultradense Heterogeneous Networks
Published 2025thesis::doctoral thesis -
16
Development of data-driven controller for slosh suppression in liquid cargo vehicles
“…At the same time, it is also worthy to consider an optimization tool for the data-driven approach that is simple to understand for engineers and can optimize a large number of control parameters in a fast manner. …”
Get full text
Get full text
Research Report -
17
A study on model-free approach for liquid slosh suppression based on stochastic approximation
“…At the same time, it is also worthy to consider an optimization tool for the model-free approach that is simple to understand for engineers and can optimize a large number of control parameters in a fast manner. …”
Get full text
Get full text
Research Report -
18
Study of hand gesture recognition using impulse radio ultra wideband (IRUWB) radar sensor
Published 2023“…Data collection experiments yield a diverse dataset of hand gestures, including variations in speed, essential for algorithm development. The developed algorithms interpret raw IR-UWB radar sensor data and associate it with specific hand gestures, addressing the core objective of gesture recognition. …”
Get full text
Get full text
Get full text
Thesis -
19
Development and optimization of Bi-GFET using Taguchi-based grey relational analysis with artificial neural network
Published 2024“…To forecast optimal optimization outcomes for the NMOS and PMOS devices a well-trained ANN is developed using the Levenberg-Marquardt algorithm. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
20
Detection of corneal arcus using rubber sheet and machine learning methods
Published 2019“…The benchmark of the classification algorithm for CA is needed to analyze the optimal output of the algorithm. …”
Get full text
Get full text
Thesis
