Search Results - (( problem solving matching algorithm ) OR ( java simulation optimization algorithm ))

Image Template Matching Based on Simulated Kalman Filter (SKF) Algorithm by Nurnajmin Qasrina, Ann, Pebrianti, Dwi, Zuwairie, Ibrahim, Luhur, Bayuaji, Mohd Falfazli, Mat Jusof

“…In order, the traditional algorithm to solve image matching problem take a lot of memory and computational time, image matching problem is assigned to optimization problem and can be solve precisely. …”
Get full text
Get full text
Get full text

Illumination-Invariant Image Matching Based on Simulated Kalman Filter (SKF) Algorithm by Nurnajmin Qasrina, Ann, Pebrianti, Dwi, Zuwairie, Ibrahim, Mohd Falfazli, Mat Jusof, Luhur, Bayuaji, Nor Rul Hasma, Abdullah

“…In order, the traditional algorithm to solve image matching problem take a lot of memory and computational time, image matching problem is assigned to optimization problem and can be solve precisely. …”
Get full text
Get full text
Get full text

Student-supervisor matching using stable marriage algorithm / Siti Farahana Nodzari by Nodzari, Siti Farahana

“…Students who do not know lecturers area and which lecturer is suitable for their project can use this system in order to find lecturer's in the same area using this matching system. So, the problem face by students to find supervisor can be solve by using this system. …”
Get full text
Get full text

SKF-based image template matching for distance measurement by using stereo vision by Nurnajmin Qasrina, Ann, Pebrianti, Dwi, Bayuaji, Luhur, Mohd Razali, Daud, Rosdiyana, Samad, Zuwairie, Ibrahim, Rosyati, Hamid, Mohammad, Syafrullah

“…The traditional algorithm to solve image matching problem take a lot of memory and computational time. …”
Get full text
Get full text
Get full text
Get full text

Image recognition using Artificial Immune systems approach by Hasnah, Ahmad, Puteh, Saad

Get full text

GPU-based odd and even hybrid string matching algorithm by Rahbari, Ghazal, Abdul Rashid, Nur’Aini, Husain, Wahidah

“…String matching is considered as one of the fundamental problems in computer science.Many computer applications provide the string matching utility for their users, and how fast one or more occurrences of a given pattern can be found in a text plays a prominent role in their user satisfaction.Although numerous algorithms and methods are available to solve the string matching problem, the remarkable increase in the amount of data which is produced and stored by modern computational devices demands researchers to find much more efficient ways for dealing with this issue.In this research, the Odd and Even (OE) hybrid string matching algorithm is redesigned to be executed on the Graphics Processing Unit (GPU), which can be utilized to reduce the burden of compute-intensive operations from the Central Processing Unit (CPU).In fact, capabilities of the GPU as a massively parallel processor are employed to enhance the performance of the existing hybrid string matching algorithms.Different types of data are used to evaluate the impact of parallelization and implementation of both algorithms on the GPU. …”
Get full text
Get full text
Get full text

Sports tournament scheduling using genetic algorithm / Hafeezur Syakir Abdul Motok@Mohd Ridzuan by Abdul Motok@Mohd Ridzuan, Hafeezur Syakir

“…In this report, a Genetic Algorithm (GA) is applied for solving University sports timetabling problems. …”
Get full text
Get full text

Simulated kalman filter (SKF) based image template matching for distance measurement by using stereo vision system by Nurnajmin Qasrina Ann, Ayop Azmi

“…Based on literature, stereo algorithm is already being implemented to solve the distance measurement problem. …”
Get full text
Get full text

Employing longest common subsequence method to retrieve translated Al-Quran documents / Muhamad Shamsudin by Shamsudin, Muhamad

“…Longest Common Subsequence algorithm (LCS) has been developed to solve string matching problems. …”
Get full text
Get full text

Guided genetic algorithm for solving unrelated parallel machine scheduling problem with additional resources by Abed, Munther Hameed, Mohd Nizam Mohmad, Kahar

“…Here, we proposed genetic algorithm (GA) to solve the UPMR problem because of the robustness and the success of GA in solving many optimization problems. …”
Get full text
Get full text
Get full text

Text searching algorithm using boyer moore horspool (BMH) algorithm by Siti Nurafiqah, Jaafar

“…The text searching is one of the famous technique uses to find data or text from the system for faster searching. Search algorithm is also known as a universal problem solving mechanism. …”
Get full text
Get full text

Shape matching and object recognition using dissimilarity measures with Hungarian algorithm by Chitra, D., Manigandan, T., Devarajan, N.

Get full text

Weighted Sum-Dijkstra’s Algorithm in Best Path Identification based on Multiple Criteria by Ting, Kien Hua, Noraini Abdullah

“…In order to achieve the objective, Weighted Sum-Dijkstra’s Algorithm (WSDA), a combination method between WSM and Dijkstra’s Algorithm is applied to solve multiple criteria network problems. …”
Get full text
Get full text
Get full text

String matching algorithms: to search and compare longest common subsequence strings retrieved from Wagner & Fischer and Hirschberg algorithms on Malay dictionary words / Mohd Razi... by Mohd Ghazi, Mohd Razif

Get full text
Get full text

Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection by Nwogbaga, Nweso Emmanuel, Latip, Rohaya, Affendey, Lilly Suriani, Abdul Rahiman, Amir Rizaan

“…The simulation is implemented with iFogSim and java programming language. …”
Get full text
Get full text

Design Of Perturbative Hyper-Heuristics For Combinatorial Optimisation by Choong, Shin Siang

“…However, exact algorithms are not feasible for solving complex problem due to its high computational overhead. …”
Get full text
Get full text

Malay cuisine cooking recipe recommendation system using Genetic Algorithm (GA) / Nur Nazihah Ismail by Ismail, Nur Nazihah

“…However, there are a few problems exists by using current system such as it is does not match with the available ingredients that user have. …”
Get full text
Get full text

Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

“…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources. 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

Fingerprint recognition system by Rohani, Abu Bakar

“…To solve this problem,a prototype for recognition fingerprint was implemented the Fast Fourier Transform (FFT) technique for features extraction and Euclidean Distance for template matching.The waterfall methodology has been used in this prototype because it can provide an orderly sequence of development steps and help to ensure the and quality,reliability, maintainability.Features extraction algorithm will produce the reference number.In addition, template matching algorithm will do the comparison between the fingerprint image based on the reference number either it is similar or not.As a result of this technique, the input fingerprint image will be match with the store fingerprint image if there are the similar images. …”
Get full text
Get full text

Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

“…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
Get full text
Get full text
Get full text