Welcome![Sign In][Sign Up]
Location:
Search - Depth Limited Search

Search list

[Windows Develop2633520_AC_62MS_312K

Description: POJ 1011 经典搜索算法 ,深度有限搜索+强剪枝-POJ 1011 classic search algorithm, depth limited english+ Strong pruning
Platform: | Size: 1024 | Author: lixin | Hits:

[AI-NN-PRbahunghou

Description: 从八皇后的例子看出搜速深度有限,仅有几层,而且不可能出现重复状态的问题,因此BACKTRACK过程完全适用,对于八数码问题则不然,必须设置深度范围限制及出现重复状态引起的死循环这两个回溯点. -Examples of Queen' s from eight to see the depth of search speed is limited, only few, but can not state the problem of duplication, so the process is fully applicable to BACKTRACK, for eight is not a digital problem, you must set the depth limit and the state caused by duplication death cycle of the two back points.
Platform: | Size: 1024 | Author: yishiwucheng | Hits:

[2D Graphicbrainee-30177

Description: An application that implement Uninformed search algorithms * Breadth-first search * Uniform-cost search * Depth-first search * Depth-limited search (tree and recursive versions) * Iterative deepening search-An application that implement Uninformed search algorithms * Breadth-first search * Uniform-cost search * Depth-first search * Depth-limited search (tree and recursive versions) * Iterative deepening search
Platform: | Size: 99328 | Author: amir | Hits:

[OtherMDS_Project

Description: A combining breadth-first search (BFS) or depth-first search (DFS) with aware range to find minimum connected dominating set A backbone in a Wireless Sensor Network (WSN) reduces the communication overhead, increases the bandwidth efficiency, decreases the overall energy consumption and thus increases network operational life.The nodes in a wireless sensor network forward data towards a sink via other nodes. The limited resources on the nodes require minimum energy to be spent in this energy consuming task. This necessitates a virtual backbone that can minimize the number of hops required to reach the sink assuming that all nodes have equal transmission range. In the wireless domain, this backbone is a minimum connected dominating set. In this paper, I propose using breadth-first search (BFS) or depth-first search (DFS) with given range to find minimum connected dominating set. Please visit: http://iftekharkabir1987.wordpress.com/
Platform: | Size: 174080 | Author: jonh | Hits:

[Data structsRomania_Trip

Description: 罗马利亚度假问题 一. 问题描述 分别用代价一致的宽度优先、有限制的深度优先(预设搜索层次)、贪婪算法和A*算法求解“罗马利亚度假问题”。即找到从初始地点 Arad到 目的地点 Bucharest 的一条路径。 要求: 分别用文件存储地图和启发函数表,用生成节点数比较几种算法在问题求解时的效率,并列表给出结果。-Romania holiday issue I. problem description Respectively, consistent with the cost of the breadth and the depth is limited priority (default search), greedy algorithm, A* algorithm Romania holidays . Bucharest Arad found the original location to the destination point of a path. Requirements: Using file storage map and the heuristic function table, nodes comparison algorithm efficiency in problem solving, and gave results list.
Platform: | Size: 360448 | Author: chen | Hits:

CodeBus www.codebus.net