It's elementary, my dear watson: Time-optimal sorting algorithms on a completely overlapping network
Several parallel architectures exist in computer science literature. Motivated by the experimental overlapping connectivity network, we propose a new theoretical network called a completely overlapping network (CON). This network is an extension of the overlapping connectivity network with multiple...
محفوظ في:
المؤلفون الرئيسيون: | Sanpawat Kantabutra, Wattana Jindaluang, Prapaporn Techa-angkoon |
---|---|
التنسيق: | Book Series |
منشور في: |
2018
|
الموضوعات: | |
الوصول للمادة أونلاين: | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=33646680497&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/62159 |
الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
المؤسسة: | Chiang Mai University |
مواد مشابهة
-
It's elementary, my dear watson: Time-optimal sorting algorithms on a completely overlapping network
بواسطة: Kantabutra S., وآخرون
منشور في: (2014) -
Under-sampling by algorithm with performance guaranteed for class-imbalance problem
بواسطة: Wattana Jindaluang, وآخرون
منشور في: (2018) -
The complexity of the overlay network verification and its related problems
بواسطة: Wattana Jindaluang, وآخرون
منشور في: (2018) -
An improved approximation algorithm for the s-t path movement problem
بواسطة: Wattana Jindaluang, وآخرون
منشور في: (2018) -
An improved approximation algorithm for the s-t path movement problem
بواسطة: Wattana Jindaluang, وآخرون
منشور في: (2018)