Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q1675274> ?p ?o }
Showing triples 1 to 25 of
25
with 100 triples per page.
- Q1675274 subject Q7005249.
- Q1675274 subject Q7216428.
- Q1675274 abstract "In computer science, iterative deepening search or more specifically iterative deepening depth-first search (IDS or IDDFS) is a state space/graph search strategy in which a depth-limited version of depth-first search is run repeatedly with increasing depth limits until the goal is found. IDDFS is equivalent to breadth-first search, but uses much less memory; on each iteration, it visits the nodes in the search tree in the same order as depth-first search, but the cumulative order in which nodes are first visited is effectively breadth-first.".
- Q1675274 wikiPageWikiLink Q1155722.
- Q1675274 wikiPageWikiLink Q131476.
- Q1675274 wikiPageWikiLink Q1377033.
- Q1675274 wikiPageWikiLink Q1777473.
- Q1675274 wikiPageWikiLink Q2033871.
- Q1675274 wikiPageWikiLink Q2059349.
- Q1675274 wikiPageWikiLink Q21198.
- Q1675274 wikiPageWikiLink Q2393193.
- Q1675274 wikiPageWikiLink Q2524691.
- Q1675274 wikiPageWikiLink Q277680.
- Q1675274 wikiPageWikiLink Q325904.
- Q1675274 wikiPageWikiLink Q5477480.
- Q1675274 wikiPageWikiLink Q570496.
- Q1675274 wikiPageWikiLink Q621673.
- Q1675274 wikiPageWikiLink Q6407553.
- Q1675274 wikiPageWikiLink Q7005249.
- Q1675274 wikiPageWikiLink Q718.
- Q1675274 wikiPageWikiLink Q7216428.
- Q1675274 wikiPageWikiLink Q7849146.
- Q1675274 wikiPageWikiLink Q816319.
- Q1675274 comment "In computer science, iterative deepening search or more specifically iterative deepening depth-first search (IDS or IDDFS) is a state space/graph search strategy in which a depth-limited version of depth-first search is run repeatedly with increasing depth limits until the goal is found.".
- Q1675274 label "Iterative deepening depth-first search".