Scalable parallel algorithms for dynamic programming on tree decomposition. (c2017)
Dynamic programming on tree decompositions is often a key for solving a widerange of optimization problems that would otherwise be intractable. Operations on tree decompositions are amenable to parallelization. However, a systematic approach towards such parallelization is still lacking. In this wor...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| التنسيق: | masterThesis |
| منشور في: |
2017
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | http://hdl.handle.net/10725/6738 https://doi.org/10.26756/th.2017.32 http://libraries.lau.edu.lb/research/laur/terms-of-use/thesis.php |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|