Scalable parallel algorithms for difficult combinatorial problems
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are used to launch systematic attacks on combinatorial problems of significance. As a case study, optimal solutions to very lar...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | , |
| التنسيق: | conferenceObject |
| منشور في: |
2004
|
| الوصول للمادة أونلاين: | http://hdl.handle.net/10725/7514 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php https://www.semanticscholar.org/paper/Scalable-parallel-algorithms-for-difficult-A-case-Abu-Khzam-Langston/6df262f3247bb5df2d028020421fcb4c45df65c1 |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|