Intro to Computation & AI

11/5/97


Click here to start


Table of Contents

Intro to Computation & AI

Review: Problem Space Search

AI & Search

Visual Processing as Search

Language Processing as Search

Problem Solving/Planning as Search

Concept Learning as Search

Intelligent Agents as Search

AI & Search: Conclusions

Game Trees

Generate-and-test

Branch-and-bound

Branch-and-bound

Branch-and-bound

Branch-and-bound

Branch-and-bound

Alpha-beta Pruning

Observations about Generate-and-test

Hill Climbing

Simple Hill Climbing

Variations/Characteristics

Best-first-search

Example: Beam Search (n=3)

Beating the Local Maxima by Preserving Diversity

Measuring Diversity: Two Approaches

Example from the Financial Domain

Author: Jill Fain Lehman

Email: jeffreys@andrew.cmu.edu