Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Optimal_substructure> ?p ?o }
Showing triples 1 to 41 of
41
with 100 triples per page.
- Optimal_substructure thumbnail Shortest_path_optimal_substructure.svg?width=300.
- Optimal_substructure wikiPageID "243102".
- Optimal_substructure wikiPageLength "5295".
- Optimal_substructure wikiPageOutDegree "20".
- Optimal_substructure wikiPageRevisionID "672193461".
- Optimal_substructure wikiPageWikiLink Bellman_equation.
- Optimal_substructure wikiPageWikiLink Category:Dynamic_programming.
- Optimal_substructure wikiPageWikiLink Category:Mathematical_optimization.
- Optimal_substructure wikiPageWikiLink Computer_science.
- Optimal_substructure wikiPageWikiLink Dynamic_programming.
- Optimal_substructure wikiPageWikiLink Greedy_algorithm.
- Optimal_substructure wikiPageWikiLink Longest_common_subsequence_problem.
- Optimal_substructure wikiPageWikiLink Longest_increasing_subsequence.
- Optimal_substructure wikiPageWikiLink Longest_path_problem.
- Optimal_substructure wikiPageWikiLink Mathematical_optimization.
- Optimal_substructure wikiPageWikiLink Overlapping_subproblems.
- Optimal_substructure wikiPageWikiLink Richard_E._Bellman.
- Optimal_substructure wikiPageWikiLink Shortest_path_problem.
- Optimal_substructure wikiPageWikiLink File:Shortest_path_optimal_substructure.svg.
- Optimal_substructure wikiPageWikiLinkText "Optimal substructure".
- Optimal_substructure wikiPageWikiLinkText "optimal substructure".
- Optimal_substructure wikiPageWikiLinkText "subproblems".
- Optimal_substructure subject Category:Dynamic_programming.
- Optimal_substructure subject Category:Mathematical_optimization.
- Optimal_substructure type Area.
- Optimal_substructure type Algorithm.
- Optimal_substructure type Area.
- Optimal_substructure type Method.
- Optimal_substructure comment "In computer science, a problem is said to have optimal substructure if an optimal solution can be constructed efficiently from optimal solutions of its subproblems. This property is used to determine the usefulness of dynamic programming and greedy algorithms for a problem.Typically, a greedy algorithm is used to solve a problem with optimal substructure if it can be proved by induction that this is optimal at each step.".
- Optimal_substructure label "Optimal substructure".
- Optimal_substructure sameAs Q2333568.
- Optimal_substructure sameAs زیربنای_بهینه.
- Optimal_substructure sameAs Sottostruttura_ottimale.
- Optimal_substructure sameAs Własność_optymalnej_podstruktury.
- Optimal_substructure sameAs m.01k89t.
- Optimal_substructure sameAs โครงสร้างย่อยที่เหมาะสมที่สุด.
- Optimal_substructure sameAs Оптимальна_підструктура.
- Optimal_substructure sameAs Q2333568.
- Optimal_substructure wasDerivedFrom Optimal_substructure?oldid=672193461.
- Optimal_substructure depiction Shortest_path_optimal_substructure.svg.
- Optimal_substructure isPrimaryTopicOf Optimal_substructure.