Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q5504599> ?p ?o }
Showing triples 1 to 17 of
17
with 100 triples per page.
- Q5504599 subject Q7216428.
- Q5504599 abstract "In computer science, fringe search is a recent graph search algorithm that finds the least-cost path from a given initial node to one goal node.In essence, fringe search is a middle ground between A* and the iterative deepening A* variant (IDA*). If g(x) is the cost of the search path from the first node to the current, and h(x) is the heuristic estimate of the cost from the current node to the goal, then ƒ(x) = g(x) + h(x), and h* is the actual path cost to the goal. Consider IDA*, which does a recursive left-to-right depth-first search from the root node, stopping the recursion once the goal has been found or the nodes have reached a maximum value ƒ. If no goal is found in the first threshold ƒ, the threshold is then increased and the algorithm searches again. I.E. It iterates on the threshold. There are three major inefficiencies with IDA*. First, IDA* will repeat states when there are multiple (sometimes non-optimal) paths to a goal node - this is often solved by keeping a cache of visited states. IDA* thus altered is denoted as memory-enhanced IDA* (ME-IDA*), since it uses some storage. Furthermore, IDA* repeats all previous operations in a search when it iterates in a new threshold, which is necessary to operate with no storage. By storing the leaf nodes of a previous iteration and using them as the starting position of the next, IDA*'s efficiency is significantly improved (otherwise, in the last iteration it would always have to visit every node in the tree). Fringe search implements these improvements on IDA* by making use of a data structure that is more or less two lists to iterate over the frontier or fringe of the search tree. One list now, stores the current iteration, and the other list later stores the immediate next iteration. So from the root node of the search tree, now will be the root and later will be empty. Then the algorithm takes one of two actions: If ƒ(head) is greater than the current threshold, remove head from now and append it to the end of later; i.e. save head for the next iteration. Otherwise, if ƒ(head) is less than or equal to the threshold, expand head and discard head, consider its children, adding them to the beginning of now. At the end of an iteration, the threshold is increased, the later list becomes the now list, and later is emptied. An important difference here between fringe and A* is that the contents of the lists in fringe do not necessarily have to be sorted - a significant gain over A*, which requires the often expensive maintenance of order in its open list. Unlike A*, however, fringe will have to visit the same nodes repeatedly, but the cost for each such visit is constant compared to the worst-case logarithmic time of sorting the list in A*.".
- Q5504599 wikiPageExternalLink IJCAI07-385.pdf.
- Q5504599 wikiPageExternalLink cig2005.pdf.
- Q5504599 wikiPageExternalLink fringesearch.
- Q5504599 wikiPageWikiLink Q1304193.
- Q5504599 wikiPageWikiLink Q1981968.
- Q5504599 wikiPageWikiLink Q21198.
- Q5504599 wikiPageWikiLink Q264164.
- Q5504599 wikiPageWikiLink Q277680.
- Q5504599 wikiPageWikiLink Q27948.
- Q5504599 wikiPageWikiLink Q5575166.
- Q5504599 wikiPageWikiLink Q7216428.
- Q5504599 wikiPageWikiLink Q816319.
- Q5504599 wikiPageWikiLink Q907955.
- Q5504599 comment "In computer science, fringe search is a recent graph search algorithm that finds the least-cost path from a given initial node to one goal node.In essence, fringe search is a middle ground between A* and the iterative deepening A* variant (IDA*). If g(x) is the cost of the search path from the first node to the current, and h(x) is the heuristic estimate of the cost from the current node to the goal, then ƒ(x) = g(x) + h(x), and h* is the actual path cost to the goal.".
- Q5504599 label "Fringe search".