Search Results - (( java simulation optimization algorithm ) OR ( based string matching algorithm ))

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

Get full text
Get full text
Get full text

Analysis of string matching compression algorithms by Nadarajan, Krishnaveny, Ahmad Zukarnain, Zuriati

“…The compression algorithms are string matching based which are LZW and LZSS. …”
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

A new text-based w-distance metric to find the perfect match between words by Ali, M., Jung, L.T., Hosam, O., Wagan, A.A., Shah, R.A., Khayyat, M.

“…The k-NN algorithm is an instance-based learning algorithm which is widely used in the data mining applications. …”
Get full text
Get full text

A new split based searching for exact pattern matching for natural texts by Hakak, Saqib Iqbal, Kamsin, Amirrudin, Shivakumara, Palaiahnakote, Idris, Mohd Yamani Idna, Gilkar, Gulshan Amin

Get full text
Get full text

Needleman wunsch implementation for SPAM/UCE inline filter by Tamil E.M., Idris M.Y.I., Thong C.M., Jali M.Z., Madihah Mohd Saudi

A Threshold-Based Combination of String and Semantic Similarity Measures for Record Linkage by Ektefa, Mohammadreza

“…Therefore, based on the experimental results, semantic similarity should be taken into account in addition to string similarity in order to detect duplicate records more effectively in recork linkage…”
Get full text

Evaluation of the effectiveness and efficiency of Wagner and Fischer algorithm in retrieving Hadith translated documents / Kamarul Arifin Muhamad by Muhamad, Kamarul Arifin

“…This thesis studies the method of a string-searching algorithm. The studies describe features and methods for string searching and comparison using Wagner and Fischer algorithm. …”
Get full text
Get full text

VLSI floor planning optimization using genetic algorithm and cross entropy method / Angeline Teoh Szu Fern by Angeline Teoh, Szu Fern

“…GA is a widely used optimization algorithm based on the concept of survival of the fittest. …”
Get full text
Get full text

Embedded car plate image recognition system by Moo Wui Hung

“…In order to speed up the image processing process, the system do not use complex algorithm such as Neural Network but use a simple algorithm such as template matching. …”
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

Web application vulnerabilities detection model by Buja, Alya Geogiana, Abd. Jalil, Kamarularifin, Mohd Ali, Fakariah, Abdul Rahman, Teh Faradilla

“…The research will be carried out by using design string matching algorithm. The algorithm is used in order to match the defined criteria of each web vulnerability with the input information about web application. …”
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

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

Word segmentation of output response for sign language devices by Za'bah, Nor Farahidah, Muhammad Nazmi, Ahmad Amierul Asyraf, Azman, Amelia Wong

“…The proposed text segmentation method in this work is by using the dynamic programming and back-off algorithm, together with the probability score using word matching with an English language text corpus. …”
Get full text
Get full text
Get full text
Get full text

Online food ordering application using Boyer-Moore algorithm / Muhammad Zulhilmie Dzulkifli by Dzulkifli, Muhammad Zulhilmie

“…The main goal of this study is to create an online food ordering app using the corresponding Boyer-Moore string matching algorithm. The application evaluation process is carried out by the developer's functionality test to ensure that there are no unnecessary issues in this app, especially in the main feature. …”
Get full text
Get full text

Heartbeat disease diagnosis using text-based approaches by Khorasani, Ehsan Safar

“…The MIDI files are then encoded to text strings using the pitch and duration information based on n-gram, these text strings then form musical words. …”
Get full text
Get full text

OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

“…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”

Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

“…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

A Web-Based Recommendation System To Predict User Movements Through Web Usage Mining by Jalali, Mehrdad

“…The longest common subsequence is a well-known string matching algorithm that we have utilized to find the most similar pattern between a set of navigation patterns and current user activities for creating the recommendations.…”
Get full text
Get full text