Search Results - (( using non method algorithm ) OR ( basic optimization method algorithm ))
Search alternatives:
- basic optimization »
- method algorithm »
- non method »
-
1
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 -
2
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 -
3
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 -
4
Schelkunoff array synthesis methods using adaptive-iterative algorithm
Published 2003“…Basically, this algorithm is a combination of iterative algorithm with adaptive algorithm. …”
Get full text
Get full text
Get full text
Thesis -
5
Algorithm development for optimization of a refrigeration system
Published 2010“…This thesis deals with algorithm development for optimization of a refrigeration system. …”
Get full text
Get full text
Undergraduates Project Papers -
6
Genetic algorithm based method for optimal location placement of flexible ac transmission system devices for voltage profile improvement
Published 2011“…This thesis present a genetic algorithm based method for placement of FACTS devices for voltage profile improvement. …”
Get full text
Get full text
Thesis -
7
Data Analysis using Particle Swarm Optimization Algorithm
Published 2015Get full text
Get full text
Final Year Project / Dissertation / Thesis -
8
Synthesis of transistor chaining algorithm for CMOS cell layout using euler path / Sukri Hanafiah
Published 1997“…After discussing about the introduction (the basic of CMOS transistor ), we will discuss how to create the Optimal layout of CMOS Functional Array with the minimum separation based on euler path method. …”
Get full text
Get full text
Thesis -
9
Mathematical formulation of tabu search in combinatorial optimization
Published 2008“…Tabu Search (TS) is a heuristic method based on the use of prohibition-based techniques and basic heuristics algorithms like local search. …”
Get full text
Get full text
Monograph -
10
Hexagon pattern particle swarm optimization based block matching algorithm for motion estimation / Siti Eshah Che Osman
Published 2019“…Recently, intelligent searching methods were proposed to enhance the computational optimization issues in motion estimation but still lack in obtaining the best solution of block matching. …”
Get full text
Get full text
Thesis -
11
Path planning algorithm for a car like robot based on MILP method
Published 2013“…This project is presents an algorithm for path planning optimal routes mobile robot “like a car” to a target in unknown environment. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
12
Enhanced Image View Synthesis Using Multistage Hybrid Median Filter For Stereo Images
Published 2018“…Disparity depth map estimation of stereo matching algorithm is one of the most active research topics in computer vision.In the field of image processing,many existing stereo matching algorithms to obtain disparity depth map are developed and designed with low accuracy.To improve the accuracy of disparity depth map is quite challenging and difficult especially with uncontrolled dynamic environment.The accuracy is affected by many unwanted aspects including random noises,horizontal streaks,low texture,depth map non-edge preserving, occlusion,and depth discontinuities.Thus,this research proposed a new robust method of hybrid stereo matching algorithm with significant accuracy of computation.The thesis will present in detail the development,design, and analysis of performance on Multistage Hybrid Median Filter (MHMF).There are two main parts involved in our developed method which combined in two main stages.Stage 1 consists of the Sum of Absolute Differences (SAD) from Basic Block Matching (BBM) algorithm and the part of Scanline Optimization (SO) from Dynamic Programming (DP) algorithm.While,Stage 2 is the main core of our MHMF as a post-processing step which included segmentation,merging, and hybrid median filtering.The significant feature of the post-processing step is on its ability to handle efficiently the unwanted aspects obtained from the raw disparity depth map on the step of optimization.In order to remove and overcome the challenges unwanted aspects, the proposed MHMF has three stages of filtering process along with the developed approaches in Stage 2 of MHMF algorithm.There are two categories of evaluation performed on the obtained disparity depth map: subjective evaluation and objective evaluation.The objective evaluation involves the evaluation on Middlebury Stereo Vision system and evaluation using traditional methods such as Mean Square Errors (MSE),Peak to Signal Noise Ratio (PSNR) and Structural Similarity Index Metric (SSIM).Based on the results of the standard benchmarking datasets from Middlebury,the proposed algorithm is able to reduce errors of non-occluded and all errors respectively.While,the subjective evaluation is done for datasets captured from MV BLUE FOX camera using human's eyes perception.Based on the results,the proposed MHMF is able to obtain accurate results, specifically 69% and 71% of non-occluded and all errors for disparity depth map, and it outperformed some of the existing methods in the literature such as BBM and DP algorithms.…”
Get full text
Get full text
Get full text
Get full text
Thesis -
13
Ant colony optimization for solving economic dispatch of power system / Muhammad Shukri Che Hashim
Published 2009“…An economic dispatch problem, consisting of six generating units is applied to compare the performance of the proposed method with those of genetic algorithm (GA) and simulated annealing (SA). …”
Get full text
Get full text
Thesis -
14
Finding minimum path by using Genetic Algorithm (GA)/ Siti Zuraifah Hashim
Published 2007“…It makes use of three basic operations in order to optimize this problem. …”
Get full text
Get full text
Thesis -
15
Tree physiology optimization on SISO and MIMO PID control tuning
Published 2018“…A simulation of SISO control system and an industrial application of MIMO control are applied to demonstrate the effectiveness of the proposed algorithm and compared with other optimization methods such as particle swarm optimization, Zieglerâ��Nichols, Tyreusâ��Luyben and Chienâ��Hronesâ��Reswick methods. …”
Get full text
Get full text
Article -
16
Noise Cancellation method in assistive listening system
Published 2020“…The noise cancellation system is categorized as active type of noise cancelling method as it includes adaptive filter and adaptive algorithm. …”
Get full text
Get full text
Undergraduates Project Papers -
17
Towards large scale unconstrained optimization
Published 2007“…The matrix-storage free BFGS (MF-BFGS) method is a method that combines with a restarting strategy to the BFGS method. …”
Get full text
Get full text
Get full text
Inaugural Lecture -
18
Nomadic people optimizer (NPO) for large-scale optimization problems
Published 2019“…Researchers have in the past few decades resorted to several methods that are inspired from complex optimization problems. …”
Get full text
Get full text
Thesis -
19
Development of cell formation algorithm and model for cellular manufacturing system
Published 2011“…The basic bacteria foraging has been successful in solving single objective non-matrix space NP-hard optimization problems. …”
Get full text
Get full text
Thesis -
20
Global Algorithms for Nonlinear Discrete Optimization and Discrete-Valued Optimal Control Problems
Published 2009“…The basic idea of the discrete filled function method is as follows. …”
Get full text
Get full text
Get full text
Thesis
