clarke@utcsri.UUCP (Jim Clarke) (09/11/85)
(SF = Sandford Fleming Building, 10 King's College Road)
(GB = Galbraith Building, 35 St. George Street)
ARTIFICIAL INTELLIGENCE SEMINAR
Tuesday, September 17, 3 pm, SF 1105
Richard Korf
University of California, Los Angeles
"Heuristic Search:
Algorithms, Invariants, and Learning"
This talk will cover three new research results in the area of heuris-
tic search. The first is a new algorithm, called Iterative-Deepening-A*,
that is asymptotically optimal in terms of solution cost, time, and space
among all admissable heuristic tree searches. In practice, it is the only
known algorithm that is capable of finding optimal solutions to the Fifteen
Puzzle. The second is a theory which unifies the treatment of heuristic
evaluation functions in single-agent problems and two-person games. The
theory is based on the notion of a heuristic as a function that is invari-
ant over optimal solution paths. Based on this theory, we performed some
experiments on the automatic learning of heuristic functions. Our program
was able to learn a set of relative weights for the different chess pieces
which is different from, but competitive with, the classical values.
COMPUTER ALGEBRA SEMINAR
Thursday, September 19, 4 pm, GB 414
Wayne Eberly,
Department of Computer Science
University of Toronto
"Parallelizing Computation of Rational Functions"
--
Jim Clarke -- Dept. of Computer Science, Univ. of Toronto, Canada M5S 1A4
(416) 978-4058
{allegra,cornell,decvax,ihnp4,linus,utzoo}!utcsri!clarke