Predicting the performance of a parallel heuristic solution for the Steiner Tree Problem
Nowadays, there is an increasing number of computer intensive applications, which exceed the capacity of a standard stand-alone computer. An alternative is to parallelize the application and run it in a cluster; there has been much work in this sense, specially in platforms and tools to build a clus...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | |
| التنسيق: | report |
| منشور في: |
2003
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | http://hdl.handle.net/20.500.12008/3489 |
| الوسوم: |
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
مواد مشابهة: Predicting the performance of a parallel heuristic solution for the Steiner Tree Problem
- Applying ant systems to two real-life assignment problems
- Distributed sparse linear regression
- Ant Colony Optimization para la resolución del Problema de Steiner Generalizado
- Solving the Generalized Steiner Problem in edge-survivable networks
- A multi-objective metaheuristic approach for the transit network design problem
- A new effective mathematical programming model to design CDN topology