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:
主要作者: | Naser, Mustafa Abdulsahib |
---|---|
格式: | Thesis |
語言: | English |
出版: |
2010
|
主題: | |
在線閱讀: | http://eprints.usm.my/24575/1/PARALLEL_QUICK_SKIP_SEARCH_HYBRID_ALGORITHM_FOR_THE_EXACT_STRING_MATCHING_PROBLEM.pdf |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
Harmony Search-Based Hyper-Heuristic For Scheduling Problems
由: Anwar, Khairul
出版: (2018) -
Parallel Platform For New Secure Stream Ciphers Based On Np-hard Problems
由: Mohammad A. Suwais, Khaled
出版: (2009) -
Adapting And Hybrid Ising Harmony Search With Metaheuristic Components For University Course Timetabling
由: Al-Betar, Mohammed Azmi
出版: (2010) -
Needs analysis on 2-Dimensional Quick Response (QR) code as a mobile
tag in genetically modified food tagging services.
由: Long , Yoon Foo
出版: (2010) -
Analogical Learner For Natural Language Processing Based On Structured String-tree Correspondence (sstc) And
Case-based Reasoning
由: Lim, Huan Ngee
出版: (2009)