Parallel Algorithms for Distinguishing Nondeterministic Finite State Machines
A Master of Science thesis in Computer Engineering by Mustafa Ali entitled, "Parallel Algorithms for Distinguishing Nondeterministic Finite State Machines," submitted in February 2015. Thesis advisor is Dr. Gerassimos Barlas and thesis co-advisor is Dr. Khaled El-Fakih. Soft and hard copy...
محفوظ في:
| المؤلف الرئيسي: | Ali, Mustafa (author) |
|---|---|
| التنسيق: | doctoralThesis |
| منشور في: |
2015
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | http://hdl.handle.net/11073/7788 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
مواد مشابهة
-
Efficient Algorithms for Constructing Preset Distinguishing Sequences for Nondeterministic Finite State Machines
حسب: Haddad, Abdul Rahim
منشور في: (2016) -
Incremental and Heuristic Algorithms for Deriving Adaptive Distinguishing Test Cases for Nondeterministic Finite State Machines
حسب: Saleh, Ayat
منشور في: (2017) -
Knowing the class distinguishing abilities of the features, to build better decision-making models
حسب: Sadhukhan, Payel
منشور في: (2024) -
A parallel optimization algorithm for the maximum clique problem. (c2008)
حسب: Rizk, Mohamad A.
منشور في: (2008) -
Parallel implementation of clique partitioning using artificial neural networks. (c2000)
حسب: Hajj, Hisham
منشور في: (2000)