In AI & ML
An algorithm that combines branch and bound, an extended list, and an admissible heuristic.
In Engineering
A form of graph search where we can get global optimality without visiting all the states.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
In AI & ML
1In Engineering
1Connections
6The lectures that define it or assume it, and the concepts next to it.