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 |
Similar Items
-
Tree-Searching Algorithms on Parallel Architectures
by: Mebrotra, Mala
Published: (1985) -
Parallel algorithms for two problems on trees
by: LAI,MING-YI, et al.
Published: (1991) -
Parallel search of game trees
by: Shved, Sofia
Published: (1988) -
Design a Parallel Hardware for Implementing Virtual B+ Search Tree
by: KUANG-LING CHIU, et al.
Published: (2005) -
Designs for Efficient Tree-Search Decoding Algorithms
by: Chia-Chun Chen, et al.
Published: (2019)