|
gptkbp:instanceOf
|
Algorithmic Paradigm
|
|
gptkbp:appliesTo
|
gptkb:Machine_Learning
gptkb:artificial_intelligence
gptkb:robot
gptkb:Network_Optimization
gptkb:Bioinformatics
gptkb:Natural_Language_Processing
gptkb:Speech_Recognition
gptkb:Game_Theory
Economics
Finance
Control System
Image Processing
Resource Management
Scheduling
Supply Chain Management
Inventory Management
Route Planning
|
|
gptkbp:approach
|
Bottom-Up
Top-Down
|
|
gptkbp:contrastsWith
|
Divide and Conquer
Greedy Algorithms
|
|
gptkbp:example
|
gptkb:Coin_Change_Problem
gptkb:Fibonacci_Sequence
gptkb:Matrix_Chain_Multiplication
gptkb:Viterbi_Algorithm
gptkb:Knapsack_Problem
gptkb:Bellman-Ford_Algorithm
gptkb:Longest_Common_Subsequence
Edit Distance
Shortest Path Algorithms
|
|
gptkbp:hasConcept
|
Optimal Substructure
Overlapping Subproblems
|
|
https://www.w3.org/2000/01/rdf-schema#label
|
Dynamic Programming
|
|
gptkbp:introduced
|
gptkb:Richard_Bellman
|
|
gptkbp:introducedIn
|
1950s
|
|
gptkbp:reducesComplexityTo
|
Polynomial Time
|
|
gptkbp:relatedTo
|
Divide and Conquer
Greedy Algorithms
Memoization
|
|
gptkbp:requires
|
Storing Intermediate Results
|
|
gptkbp:solvedBy
|
Problems with Exponential Brute Force Complexity
|
|
gptkbp:usedFor
|
Resource Allocation
Optimization Problems
Solving Recurrence Relations
|
|
gptkbp:usedIn
|
gptkb:Mathematics
Computer Science
Operations Research
|
|
gptkbp:bfsParent
|
gptkb:mathematical_optimization
|
|
gptkbp:bfsLayer
|
5
|