搜索资源列表
-
0下载：
The basis of branch and bound algorithms is a ranking function. The ranking function assigns a value to each node in the graph. At each step, a branch and bound algorithm uses the ranking function to decide which node to expand next. In contrast, the
-
-
0下载：
e: C# code tha implements the Breadth-first-search (BFS) search algorithm. The program solves the 8-puzzle game using the algorithm
-
-
0下载：
This the algorithm of BFS(breadth first search)- This is the algorithm of BFS(breadth first search)
-
-
0下载：
The primary objective of the QRD-M detector is to identify the candidate list.
The QRD-M algorithm is a breadth-first tree search.
It views all the branches it will ever consider for a given stage of the detection tree and then rejects all but t
-
-
0下载：
球形解码( Sphere Decoder，SD) 算法能以较低的复杂度实现多输入多输出( Multiple Input Multiple Output，MIMO) 系统的最优检测，是当前受到普遍关注的 MIMO 检测算法。对当前球形解码 的 主 要 研究 成 果 进行 综 述，根 据 搜索策略进行分类，重点分析基于深度优先策略的 VB、CL 和基于宽度优先策略的 K-Best、FSD 算法，并且讨论了几种初始半径的选择方法，最后在准静态平坦瑞利衰落环境下对上述算法进行了性能仿真比较-Sphere
-
