Search Results - (( _ implementation developing algorithm ) OR ( problem implementation new algorithm ))
Search alternatives:
- implementation developing »
- problem implementation »
- implementation new »
- new algorithm »
-
1
Low-level hybridization scripting language with dynamic parameterization in PSO-GA / Suraya Masrom
Published 2015“…However, in many cases, implementing the suitable hybrid algorithms for a given optimization problem is a considerably difficult, which in most cases, is time consuming. …”
Get full text
Get full text
Thesis -
2
Optimization Of Two-Dimensional Dual Beam Scanning System Using Genetic Algorithms
Published 2008“…This algorithm has been tested and implemented successfully via a dual beam optical scanning system.…”
Get full text
Get full text
Thesis -
3
Fast Finite Difference Time Domain Algorithms for Solving Antenna Application Problem
Published 2008“…This thesis describes the implementations of new parallel and sequential algorithms for electromagnetic wave propagation from a monopole antenna. …”
Get full text
Get full text
Thesis -
4
Traffic management algorithms for LEO satellite networks
Published 2016“…Overall, from all the three experiments that have been conducted, the proposed routing algorithms which have been developed to manage the network traffic have proved better than the previously developed algorithms in several perspectives especially for the implementation of real-time applications in LEO satellite networks.…”
Get full text
Get full text
Get full text
Thesis -
5
Low-level hybridization scripting language with dynamic parameterization in PSO-GA / Suraya Masrom
Published 2015“…However, in many cases, implementing the suitable hybrid algorithms for a given optimization problem is a considerably difficult, which in most cases, is time consuming. …”
Get full text
Get full text
Book Section -
6
Enhancement of Ant System Algorithm for Course Timetabling Problem
Published 2009“…In order to develop a new algorithm for the course scheduling problem, this research follows the experimental research methodology that consist of problem analysis, designing algorithm, implementing algorithm as a computer program in order to examine the results, analyzing the results, and if necessary improving the algorithm by doing all those activities over and over again. …”
Get full text
Get full text
Get full text
Thesis -
7
New Quarter-Sweep-Based Accelerated Over-Relaxation Iterative Algorithms and their Parallel Implementations in Solving the 2D Poisson Equation
Published 2010“…The parallel strategies used in the new algorithms are based on the message latency minimization and processor-independent iterations.…”
Get full text
Get full text
Thesis -
8
An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion
Published 2018“…We have chosen four neighborhood based algorithms which are commonly used in optimization problems and divided them in newly implemented and re-implemented category. …”
Get full text
Get full text
Thesis -
9
Diagnosis of eyesight using Improved Clonal Selection Algorithm (ICLONALG) / Nor Khirda Masri
Published 2017“…This study aims to implement the classification algorithm using the Improved Clonal Selection Algorithm (ICLONALG) to classify the eyesight’s problems. …”
Get full text
Get full text
Thesis -
10
Ant colony optimization algorithm for dynamic scheduling of jobs in computational grid
Published 2012“…In computational grid, job scheduling is one of the main factors affecting grid computing performance. Job scheduling problem is classified as an NP-hard problem.Such a problem can be solved only by using approximate algorithms such as heuristic and meta-heuristic algorithms.Among different optimization algorithms for job scheduling, ant colony system algorithm is a popular 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 research focuses on a new heuristic function where information about recent ants’ discoveries has been considered.The new heuristic function has been integrated into the classical ant colony system algorithm.Furthermore, the enhanced algorithm has been implemented to solve the travelling salesman problem as well as in scheduling of jobs in computational grid.A simulator with dynamic environment feature to mimic real life application has been development to validate the proposed enhanced ant colony system algorithm. …”
Get full text
Get full text
Monograph -
11
The normalized random map of gradient for generating multifocus image fusion
Published 2020“…Many researchers have developed many new and sophisticated methods. They show complicated computation and algorithm. …”
Get full text
Get full text
Get full text
Article -
12
Design and development of sensor based traffic light system
Published 2006“…Hardware simulation tests were successfully performed on the algorithm implemented into a controller. The new timing scheme that was implemented promises an improvement in the current traffic light system and this system is feasible, affordable and ready to be implemented especially during peak hours. …”
Get full text
Get full text
Get full text
Article -
13
Design and implementation of multimedia digital matrix system
Published 2005“…Due to the issues of signal integrity in high-speed digital design, a new adaptive channel synchronization algorithm has been developed. …”
Get full text
Get full text
Conference or Workshop Item -
14
Thalassaemia detection using CBR Algorithm via mobile device
Published 2011“…This thesis proposes a Case-Based Reasoning model for medical diagnosis,particularly for Thalassaemia diagnosis. CBR Algorithm is an algorithm that can solve a new problem by remembering a previous similar situation and by reusing information and knowledge of that situation in a new situation.CBR is suit for solving the problem in Thalassaemia cases.The model is designed and prototype is developed to test the diagnosis accuracy of the model.T his application is focus on Beta Thalassaemia and Haemoglobin E Trait only.For platform, this application will be using the mobile device such as PDA. …”
Get full text
Get full text
Undergraduates Project Papers -
15
Thalassaemia detection using CBR Algorithm via mobile device
Published 2011“…This thesis proposes a Case-Based Reasoning model for medical diagnosis,particularly for Thalassaemia diagnosis. CBR Algorithm is an algorithm that can solve a new problem by remembering a previous similar situation and by reusing information and knowledge of that situation in a new situation.CBR is suit for solving the problem in Thalassaemia cases.The model is designed and prototype is developed to test the diagnosis accuracy of the model.T his application is focus on Beta Thalassaemia and Haemoglobin E Trait only.For platform, this application will be using the mobile device such as PDA. …”
Get full text
Get full text
Undergraduates Project Papers -
16
Simulated kalman filter (SKF) based image template matching for distance measurement by using stereo vision system
Published 2018“…Based on literature, stereo algorithm is already being implemented to solve the distance measurement problem. …”
Get full text
Get full text
Thesis -
17
Classification System for Heart Disease Using Bayesian Classifier
Published 2007“…This system was developing base on to three main part which is data processing, testing and implementation of the algorithm. …”
Get full text
Get full text
Thesis -
18
A machine learning approach to tourism recommendations system
Published 2025“…To overcome this problem, this project implements machine learning algorithms with collaborative filtering, content-based filtering and hybrid filtering approaches. …”
Get full text
Get full text
Final Year Project / Dissertation / Thesis -
19
-
20
A faster version of Rijndael Cryptograpic algorithm using cyclic shift and bitwise operations
Published 2004“…The new approach algorithm speed increment has consistently increased in between 18% to 22% microsecond for encryption and 30% to 34% for decryption compared to Rijndael algorithm.…”
Get full text
Get full text
Thesis
