Demonstrations
From 6.034 Wiki
(Difference between revisions)
| Line 11: | Line 11: | ||
* Constraint satisfaction: drawing analysis (after Waltz, using Huffman labels) | * Constraint satisfaction: drawing analysis (after Waltz, using Huffman labels) | ||
* Domain reduction: map coloring, resource allocation | * Domain reduction: map coloring, resource allocation | ||
| + | * Learning: nearest neighbors, self-organizing maps, support vector machines, boosting | ||
Revision as of 13:14, 9 November 2006
Much of the material in 6.034 is reinforced by on-line demonstrations develop by us or otherwise available on the web. Those developed by us are provided via the easy-to-use Java Web Start mechanism, which comes with the Java Runtime Environment, the so-called JRE.
The demonstrations illustrate the following ideas:
- Blocks world manipulation (after Winograd)
- Search: depth-first, breadth-first, hill-climbing, beam, branch and bound, A*
- Games: mini-max, alpha-beta
- Genetic algorithms: crossover, mutation, fitness
- Constraint satisfaction: drawing analysis (after Waltz, using Huffman labels)
- Domain reduction: map coloring, resource allocation
- Learning: nearest neighbors, self-organizing maps, support vector machines, boosting
So, if you don't have the Java Runtime Enviornment installed,
you should install it first. Then, you
can run the demonstrations.
