| 1. | The provider uses a subtree search starting at the search point specified in the connection string
提供程序从连接字符串中指定的搜索点开始执行子树搜索。 |
| 2. | This method can be used not only for search space of left - deep but also for hybrid search spaces
该方法不仅可用于左深度树搜索空间，同样适用于混合搜索空间。 |
| 3. | In the problems of minimax tree search , what we are looking for is often the optimal branch at the root node
在极大极小树搜索时，我们经常寻找的是根节点的最优分支。 |
| 4. | All other operations , including any search methods , perform subtree searches rooted at the container
所有其他操作（包括所有搜索方法） ，都以该容器作为根来执行子树搜索。 |
| 5. | This makes prbfm a promising emerging game - tree search algorithm in future chip multiprocessor platforms
这使得prbfm成为将来多核处理器( cmp )多线程游戏树搜索benchmark的一个有力的备选算法。 |
| 6. | The provider uses a subtree search starting at the search point specified in the connection string to determine whether a user exists
提供程序从连接字符串中指定的搜索点开始执行子树搜索，以确定用户是否存在。 |
| 7. | This paper sets forth the two methods for topology analysis : neighboring matrix method and tree _ search method , which are in common use
本文详细地阐述了网络拓扑分析中两种常用的分析方法：邻接矩阵法和树搜索法。 |
| 8. | The proposed classification method consists of two key processing stages : the improved constrained search on an interpretation tree and the following shape similarity measure computation
所提的物体分类方法主要包括2个核心处理模块，即改进的约束解释树搜索和形状相似性度量计算。 |
| 9. | This thesis discloses some key workload characteristics of tree search applications in some sense , while gives some data support to design intel platform ’ s chip multprocessor
本文在一定程度上揭示了并行树搜索程序在smp平台上的关键负载特征,为intel平台设计多核处理器提供了一些数据支持。 |
| 10. | Game - tree search plays an important role in the field of artificial intelligence . in this paper we characterize and compare two parallel game - tree search workloads in chess on two intel xeon
游戏树搜索( game - treesearch )一直以来在人工智能领域扮演着极其重要的角色,并行游戏树搜索更是该领域的热点研究问题。 |
