The Design and Analysis of Parallel Tree-Searching Algorithms
碩士 === 國防管理學院 === 資源管理研究所 === 86 === Tree-Searching algorithms may solve many problems which are indicated in tree structure. "Branch-and-bound strategy" can effectively decrease searching times and shorten problem-solving time. We can see the obvious performance if we make them parallel...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1998
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/89579526016365135399 |