About: Dynamic programming

An Entity of Type: Concept, from Named Graph: http://dbpedia.org, within Data Space: dbpedia.org

Property	Value
dbo:wikiPageID	2699398 (xsd:integer)
dbo:wikiPageRevisionID	824763203 (xsd:integer)
dbp:wikiPageUsesTemplate	dbt:Hatnote dbt:Cat_main
rdf:type	skos:Concept
rdfs:label	Dynamic programming (en)
skos:broader	dbc:Sequential_methods dbc:Optimization_algorithms_and_methods dbc:Optimal_decisions
skos:prefLabel	Dynamic programming (en)
prov:wasDerivedFrom	wikipedia-en:Category:Dynamic_programming?oldid=824763203&ns=14
is dbo:wikiPageWikiLink of	dbr:Bellman_equation dbr:Partially_observable_Markov_decision_process dbr:Bellman–Ford_algorithm dbr:Approximate_string_matching dbr:Curse_of_dimensionality dbr:Dynamic_discrete_choice dbr:Dynamic_time_warping dbr:Levenshtein_distance dbr:Maximum_subarray_problem dbr:Optimal_stopping dbr:Optimal_substructure dbr:Hamilton–Jacobi–Bellman_equation dbr:Matrix_chain_multiplication dbr:Recursive_economics dbr:Viterbi_algorithm dbr:Held–Karp_algorithm dbr:Line_wrap_and_word_wrap dbr:Damerau–Levenshtein_distance dbr:Dynamic_programming dbr:Earley_parser dbr:Floyd–Warshall_algorithm dbr:Forward–backward_algorithm dbr:Hirschberg's_algorithm dbr:Quadratic_knapsack_problem dbr:Backward_induction dbr:Hunt–Szymanski_algorithm dbr:Shortest_common_supersequence_problem dbr:Bitonic_tour dbr:Needleman–Wunsch_algorithm dbr:Differential_dynamic_programming dbr:Automatic_basis_function_construction dbr:Knapsack_problem dbr:Longest_alternating_subsequence dbr:Longest_common_subsequence_problem dbr:Longest_common_substring_problem dbr:Longest_increasing_subsequence dbr:Markov_decision_process dbr:Subset_sum_problem dbr:Smith–Waterman_algorithm dbr:WASP_(cricket_calculation_tool) dbr:Ruzzo–Tompa_algorithm dbr:Value_function dbr:Overlapping_subproblems dbr:Viscosity_solution dbr:Stochastic_dynamic_programming
is dcterms:subject of	dbr:Bellman_equation dbr:Partially_observable_Markov_decision_process dbr:Bellman–Ford_algorithm dbr:Approximate_string_matching dbr:Curse_of_dimensionality dbr:Dynamic_discrete_choice dbr:Dynamic_time_warping dbr:Levenshtein_distance dbr:Maximum_subarray_problem dbr:Optimal_stopping dbr:Optimal_substructure dbr:Hamilton–Jacobi–Bellman_equation dbr:Matrix_chain_multiplication dbr:Recursive_economics dbr:Viterbi_algorithm dbr:Held–Karp_algorithm dbr:Line_wrap_and_word_wrap dbr:Damerau–Levenshtein_distance dbr:Dynamic_programming dbr:Earley_parser dbr:Floyd–Warshall_algorithm dbr:Forward–backward_algorithm dbr:Hirschberg's_algorithm dbr:Quadratic_knapsack_problem dbr:Backward_induction dbr:Hunt–Szymanski_algorithm dbr:Shortest_common_supersequence_problem dbr:Bitonic_tour dbr:Needleman–Wunsch_algorithm dbr:Differential_dynamic_programming dbr:Automatic_basis_function_construction dbr:Knapsack_problem dbr:Longest_alternating_subsequence dbr:Longest_common_subsequence_problem dbr:Longest_common_substring_problem dbr:Longest_increasing_subsequence dbr:Markov_decision_process dbr:Subset_sum_problem dbr:Smith–Waterman_algorithm dbr:WASP_(cricket_calculation_tool) dbr:Ruzzo–Tompa_algorithm dbr:Value_function dbr:Overlapping_subproblems dbr:Viscosity_solution dbr:Stochastic_dynamic_programming