Sign inSign in
ConceptAI & ML

Exhaustive search

A method to find the simplest tree by evaluating every possible binary tree topology for a given set of taxa.
as Stephen C. Stearns defines itYale UniversityThe wording closest to all 3 definitions
Watch it explained

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.

Binary tree topologies1Game trees1Minimax1Search spaces1Trait matrix1

Opens up

Concepts that name this one as a prerequisite.

Lecturers

3

Each in their own terms, from the easiest level.

  • Saman Amarasinghe

    MIT · Undergraduate

    An empirical evaluation approach that tests all possible integer values for a parameter.
    • 1:06:49Domain Specific Languages and Autotuning
  • Pieter Abbeel & Daniel Klein

    UC Berkeley · Undergraduate

    Searching through all possible game tree scenarios, which is infeasible for games with large branching factors like chess and Go.
    • 10:55Robotics, Language, and Vision

Connections

5

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

Concepts2

Lectures3

3 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.