Parallel Quick-Skip Search Hybrid Algorithm For The Exact String Matching Problem.
Masalah padanan rententan merupakan mercu tanda dalam kebanyakan bidang sains komputer kerana peranan yang dimainkannya dalam pelbagai aplikasi komputer. The string matching problem occupies a corner stone in many computer science fields because of the fundamental role it plays in various compute...
Saved in:
Main Author: | Naser, Mustafa Abdulsahib |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2010
|
Subjects: | |
Online Access: | http://eprints.usm.my/24575/1/PARALLEL_QUICK_SKIP_SEARCH_HYBRID_ALGORITHM_FOR_THE_EXACT_STRING_MATCHING_PROBLEM.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Harmony Search-Based Hyper-Heuristic For Scheduling Problems
by: Anwar, Khairul
Published: (2018) -
Parallel Platform For New Secure Stream Ciphers Based On Np-hard Problems
by: Mohammad A. Suwais, Khaled
Published: (2009) -
Adapting And Hybrid Ising Harmony Search With Metaheuristic Components For University Course Timetabling
by: Al-Betar, Mohammed Azmi
Published: (2010) -
Needs analysis on 2-Dimensional Quick Response (QR) code as a mobile
tag in genetically modified food tagging services.
by: Long , Yoon Foo
Published: (2010) -
Analogical Learner For Natural Language Processing Based On Structured String-tree Correspondence (sstc) And
Case-based Reasoning
by: Lim, Huan Ngee
Published: (2009)