1
Q
What is the dynamic programming search (description)?
A
Build a table dist(n) storing shortest path from node n to goal.
2
Q
What is the bellman ford equation for dynammic programming graph search?
A
CS255 - SEARCHES
flashcards
Decks in class (20)
# Cards
-
Greedy Best First Search1
-
A* Search3
-
Heuristics1
-
Iterative Deepning1
-
tree search2
-
Bi - directional search1
-
Depth First Branch and Bound1
-
Hill Climbing Search1
-
Stochastic Local Search1
-
Simulated Annealing2
-
Beam Search2
-
Genetic Algorithms1
-
Parrallel Search1
-
Lowest Cost First Search1
-
Heuristic depth first search1
-
Bounded Depth First Search1
-
Search Optimisation4
-
Dynammic Programming Search2
-
Minimax2
-
Alpha Beta Pruning2
