![]() |
![]() |
![]() |
||||||||||||||||||||||||||||||||||||||||
|
Thursday, May 24, 2007 |
|||
|
May 24 |
4:15 p.m. - 5:45 p.m. |
CS 201:Recent Progress in Heuristic Search: A Case-Study of the 4-Peg Towers of Hanoi Problem, Richard Korf (joint work with Ariel Felner), UCLA
|