Matches in DBpedia 2016-04 for { <http://citation.dbpedia.org/hash/83498c83759f20b7ea91f4ffd49aa0547232d8156d1b8b0f634451730cb1097d> ?p ?o }
Showing triples 1 to 3 of
3
with 100 triples per page.
- 83498c83759f20b7ea91f4ffd49aa0547232d8156d1b8b0f634451730cb1097d date "August 2015".
- 83498c83759f20b7ea91f4ffd49aa0547232d8156d1b8b0f634451730cb1097d isCitedBy Iterative_deepening_depth-first_search.
- 83498c83759f20b7ea91f4ffd49aa0547232d8156d1b8b0f634451730cb1097d reason "It's false. Say there is a path of cost 2+4+6 where the goal is at depth 3, and a path 1+2+3+4 where the goal is at depth 4. These cost functions are both non-decreasing functions of the depth of a node. IDDFS could find the goal at level 3, with a total cost of 12, before finding the goal at level 4, with a total cost of 10. So, IDDFS is optimal only if all steps cost the same.".