Virtual topologies for massively parallel computations. (c2015)
In their essence, recursive search tree algorithms are nothing but mere enumeration of the solution space. Most of the time is spent generating new search tree nodes with very little computation performed at each tree node. Massively parallel computations that are based on such algorithms often suff...
Saved in:
| Main Author: | Jahed, Karim A. (author) |
|---|---|
| Format: | masterThesis |
| Published: |
2015
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10725/2122 https://doi.org/10.26756/th.2015.13 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Parallel implementation of clique partitioning using artificial neural networks. (c2000)
by: Hajj, Hisham
Published: (2000) -
Scalable parallel algorithms for dynamic programming on tree decomposition. (c2017)
by: Yassine, Mohamad M.
Published: (2017) -
A parallel optimization algorithm for the maximum clique problem. (c2008)
by: Rizk, Mohamad A.
Published: (2008) -
A decentralized load balancing strategy for parallel search-three optimization. (c2010)
by: Mouawad, Amer E.
Published: (2010) -
A Collaborative Service Discovery and Service Sharing Framework for Mobile Ad Hoc Networks
by: Safa, Haidar
Published: (2007)