Sign inSign in

A*

One word, taught differently in 2 fields. Each use is given apart.

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

1

    In Engineering

    1

      Connections

      6

      The lectures that define it or assume it, and the concepts next to it.

      2 lecturers. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.