Search Results - (( developing program matching algorithm ) OR ( java optimization system algorithm ))
Search alternatives:
- optimization system »
- developing program »
- java optimization »
- program matching »
- system algorithm »
-
1
Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing
Published 2011“…A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
Get full text
Get full text
Get full text
Thesis -
2
Optimization of blood vessel detection in retina images using multithreading and native code for portable devices
Published 2013“…The optimization of a computationally intensive algorithm such as this on a mobile platform is challenging due to the limited resources available. …”
Get full text
Get full text
Conference or Workshop Item -
3
Route Optimization System
Published 2005“…The distinct lack of route optimization systems or route generation system in Malaysia was the motivational factor behind this project. …”
Get full text
Get full text
Final Year Project -
4
Development Of Double Stage Filter (DSF) On Stereo Matching Algorithm For 3D Computer Vision Applications
Published 2016“…This thesis will present the design, development and analysis of performance on a developed Double Stage Filter (DSF) algorithm and other existing stereo matching algorithms. …”
Get full text
Get full text
Get full text
Get full text
Thesis -
5
Automatic Number Plate Recognition on android platform: With some Java code excerpts
Published 2016“…Hence, the objective of this research is to propose suitable and optimize algorithm for ANPR system on Android mobile phone. …”
Get full text
Get full text
Get full text
Book -
6
Ant colony optimization algorithm for load balancing in grid computing
Published 2012“…This research proposes an enhancement of the ant colony optimization algorithm that caters for dynamic scheduling and load balancing in the grid computing system. …”
Get full text
Get full text
Get full text
Monograph -
7
-
8
Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization
Published 2019“…This study proposes a car parking management system which applies Dijkstra’s algorithm, Ant Colony Optimization (ACO) and Binary Search Tree (BST) in structuring a guidance system for indoor parking. …”
Get full text
Get full text
Thesis -
9
Optimal route checking using genetic algorithm for UiTM's bus services / Tengku Salman Fathi Tengku Jaafar
Published 2006“…This research study with the development of the Optimal Route Checking Using Genetic Algorithm system should solve this scenario. …”
Get full text
Get full text
Thesis -
10
Fuzzy modeling using Bat Algorithm optimization for classification
Published 2018Get full text
Get full text
Get full text
Undergraduates Project Papers -
11
-
12
Features selection for intrusion detection system using hybridize PSO-SVM
Published 2016“…Hybridize Particle Swarm Optimization (PSO) as a searching algorithm and support vector machine (SVM) as a classifier had been implemented to cope with this problem. …”
Get full text
Get full text
Thesis -
13
Comparison of performances of Jaya Algorithm and Cuckoo Search algorithm using benchmark functions
Published 2022Get full text
Get full text
Get full text
Get full text
Conference or Workshop Item -
14
Input-output based relation combinatorial testing using whale optimization algorithm for generating near optimum number of test suite
Published 2025“…This study proposes a combinatorial testing method utilizing the Whale Optimization Algorithm (WOA). The study compares the performance of WOA with various existing strategies, such as Greedy, Density, TVG, Union, ParaOrder, ReqOrder, ITTDG, AURA, Java Algorithm (CTJ), TTSGA, and AFA. …”
Get full text
Get full text
Get full text
Article -
15
Resource management in grid computing using ant colony optimization
Published 2011“…Managing resources in grid computing system is complicated due to the distributed and heterogeneous nature of the resources.Stagnation in grid computing system may occur when all jobs require or are assigned to the same resources which lead to the resources having high workload or the time taken to process a job is high.This research proposes an Enhanced Ant Colony Optimization (EACO) algorithm that caters dynamic scheduling and load balancing in the grid computing system.The algorithm consists of three new mechanisms that organize the work of an ant colony i.e. initial pheromone value mechanism, resource selection mechanism and pheromone update mechanism.The resource allocation problem is modeled as a graph that can be used by the ant to deliver its pheromone.This graph consists of four types of vertices which are job, requirement, resource and capacity that are used in constructing the grid resource management element.The proposed EACO algorithm takes into consideration the capacity of resources and the characteristics of jobs in determining the best resource to process a job.EACO selects the resources based on the pheromone value on each resource which is recorded in a matrix form.The initial pheromone value of each resource for each job is calculated based on the estimated transmission time and execution time of a given job. …”
Get full text
Get full text
Get full text
Get full text
Monograph -
16
OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT
Published 2023“…The scheduled cloudlets must be executed efficiently by using the available resources to improve system performance. To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”
Review -
17
Can recognition using LABVIEW / Jamilah Othman
Published 2008Get full text
Get full text
Student Project -
18
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 -
19
Employing longest common subsequence method to retrieve translated Al-Quran documents / Muhamad Shamsudin
Published 2001“…Longest Common Subsequence algorithm (LCS) has been developed to solve string matching problems. …”
Get full text
Get full text
Thesis -
20
A filtering algorithm for efficient retrieving of DNA sequence
Published 2009“…An automaton-based algorithm is used to develop the filtering process proposed. …”
Get full text
Get full text
Get full text
Article
