ConceptAI & ML
Exhaustive search
A method to find the simplest tree by evaluating every possible binary tree topology for a given set of taxa.
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.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
3Each in their own terms, from the easiest level.
Saman Amarasinghe
An empirical evaluation approach that tests all possible integer values for a parameter.Pieter Abbeel & Daniel Klein
Searching through all possible game tree scenarios, which is infeasible for games with large branching factors like chess and Go.
Connections
5The lectures that define it or assume it, and the concepts next to it.