Search Results - (( basic optimization method algorithm ) OR ( using factor (problems OR problem) algorithm ))
Search alternatives:
- basic optimization »
- method algorithm »
- using factor »
-
1
Optimal power flow based on fuzzy linear programming and modified Jaya algorithms
Published 2017“…Meanwhile, the proposed QOJaya algorithm produces better results than the basic Jaya method in terms of solution optimality and convergence speed. …”
Get full text
Get full text
Thesis -
2
Data Analysis using Particle Swarm Optimization Algorithm
Published 2015Get full text
Get full text
Final Year Project / Dissertation / Thesis -
3
Image watermarking optimization algorithms in transform domains and feature regions
Published 2012“…The achieved tradeoffs from these techniques between imperceptibility and robustness are controversial.To solve this problem,this study proposes the application of artificial intelligent techniques into digital watermarking by using discrete wavelet transform (DWT) and singular value decomposition (SVD).To protect the copyright information of digital images,the original image is decomposed according to two-dimensional discrete wavelet transform.Subsequently the preprocessed watermark with an affined scrambling transform is embedded into the vertical subband (HLm) coefficients in wavelet domain without compromising the quality of the image.The scaling factors are trained with the assistance of Particle Swarm Optimization (PSO).A new algorithmic framework is used to forecast feasibility of hypothesized watermarked images.In addition,the novelty is to associate the Hybrid Particle Swarm Optimization (HPSO),instead of a single optimization,as a model with SVD.To embed and extract the watermark,the singular values of the blocked host image are modified according to the watermark and scaling factors. …”
Get full text
Get full text
Thesis -
4
Improving Attentive Sequence-to-Sequence Generative-Based Chatbot Model Using Deep Neural Network Approach
Published 2022“…The strategies applied showed that the final accuracy obtained through the training after implementing a modification in the algorithm is at 81% accuracy rate compared to the basic model that recorded its final accuracy at 79% accuracy rate. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
5
Solving power system state estimation using orthogonal decomposition algorithm / Tey Siew Kian
Published 2009“…The application of orthogonal decomposition method using Householder transformation (refer to section 3.3) is used to solve the least-squares problem in power system state estimation. …”
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
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
Get full text
Get full text
Get full text
Get full text
Get full text
Thesis -
6
Public healthcare facility planning in Malaysia : Using location allocation models / S. Sarifah Radiah Shariff
Published 2012“…Two basic location allocation models with two different objectives are studied: The p-median problem and the Maximal Covering Location Problem (MCLP). …”
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 -
7
Particle swarm optimization (PSO) for CNC route problem
Published 2002“…We often see many of the method of Genetic Algorithm (GA), Ant Colony Optimization (ACO), Simulated Annealing Algorithm (SAA) and PSO are used for any optimization problems. …”
Get full text
Get full text
Undergraduates Project Papers -
8
Enhancement of Ant System Algorithm for Course Timetabling Problem
Published 2009“…As the requirement of the Ant System Algorithm, the problem is modeled as a graph that can be used by the ant to deliver its pheromone. …”
Get full text
Get full text
Get full text
Thesis -
9
Heuristic factors in ant system algorithm for course timetabling problem
Published 2009“…This paper presents an algorithm that is based on ant system to solve the course timetabling problem.The problem is modeled using the bipartite graph.Four heuristic factors are derived from the graph characteristic, are used to direct ants as the agent in finding course timetable elements The concept of negative pheromone was also applied to ensure that paths leading to dead ends are not chosen.The performance of this proposed algorithm is promising when comparison of performance was made with the original ant system algorithm. …”
Get full text
Get full text
Conference or Workshop Item -
10
A new cryptographic algorithm based on decomposition problem in elliptic curve cryptography / Hilyati Hanina Zazali
Published 2012“…Since subexponential-time algorithm is known for ordinary discrete logarithm problem and integer factorization problem and not for elliptic curve discrete logarithm problem, the algorithm presented for the digital signature in this study has substantially greater strength per key bit than in other digital signature algorithm…”
Get full text
Get full text
Get full text
Get full text
Get full text
Thesis -
11
Voting algorithms for large scale fault-tolerant systems
Published 2011“…To solve this problem and gain benefits of this algorithm, we employed parallel algorithm technique and by using optimal number of processors, we could propose optimal algorithms known as Parallel Average Voting and Parallel Weighted Average Voting which both have optimal time complexity and less calculation cost. …”
Get full text
Get full text
Thesis -
12
Modification of the ant colony optimization algorithm for solving multi-agent task allocation problem in agricultural application
Published 2024“…Simulation results showed that the proposed ACO algorithm with the modified efficiency factor improved the performance of basic ACO algorithm for solving task allocation problem in terms of the average total travel cost for each agent. …”
Get full text
Get full text
Get full text
Article -
13
Factors and types of error that contributes to the difficulties in solving Mathematical problems among Year 5 pupils in SK Goebilt, Kuching / Hardi Rasidi
Published 2016“…The objectives of this research are to identify the factors and types of algorithm error that contributes to difficulties in solving mathematical word problems. …”
Get full text
Get full text
Thesis -
14
Multi-objective constrained algorithm (MCA) and non-dominated sorting genetic algorithm (NSGA-ii) for solving multi-objective crop planning problem
Published 2016“…In this paper, we formulate a crop planning problem as a multiobjective optimization model and try to solve two different versions of the problem using two different optimization algorithms MCA and NSGA. …”
Get full text
Get full text
Get full text
Get full text
Article -
15
Three-term backpropagation algorithm for classification problem
Published 2006“…Standard Backpropagation Algorithm (BP) is a widely used algorithm in training Neural Network that is proven to be very successful in many diverse application. …”
Get full text
Get full text
Thesis -
16
Using Electromagnetism-like algorithm and genetic algorithm to optimize time of task scheduling for dual manipulators
Published 2023“…A method based on Electromagnetism-Like algorithm (EM) and Genetic Algorithm (GA) is proposed to determine the time-optimal task scheduling for dual robot manipulators. …”
Conference paper -
17
Tiki-taka algorithm: a novel metaheuristic inspired by football playing style
Published 2021“…The algorithm was tested using 19 benchmark functions and five engineering design problems. …”
Get full text
Get full text
Get full text
Article -
18
New heuristic function in ant colony system for job scheduling in grid computing
Published 2012“…Job scheduling is one of the main factors affecting grid computing performance. Job scheduling problem classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Ant colony system algorithm is a meta-heuristic algorithm which has the ability to solve different types of NP-hard problems.However, ant colony system algorithm has a deficiency in its heuristic function which affects the algorithm behavior in terms of finding the shortest connection between edges.This paper focuses on enhancing the heuristic function where information about recent ants’ discoveries will be taken into account.Experiments were conducted using a simulator with dynamic environment features to mimic the grid environment.Results show that the proposed enhanced algorithm produce better output in term of utilization and make span.…”
Get full text
Get full text
Conference or Workshop Item -
19
Comparative Analysis of Low Discrepancy Sequence-Based Initialization Approaches Using Population-Based Algorithms for Solving the Global Optimization Problems
Published 2021“…Metaheuristic algorithms have been widely used to solve diverse kinds of optimization problems. …”
Get full text
Get full text
Get full text
Get full text
Get full text
Article -
20
An alternative method to solve combined economic emission dispatch problems using flower pollination algorithm
Published 2016“…To simplify the programming, objective of economic dispatch (ED) and emission dispatch (EmD) are combined into a single function by price penalty factor and analysed using weighted sum method to choose the best compromising result. …”
Get full text
Get full text
Thesis