Course Learning Outcomes: Students are expected to use various search algorithms according to constraints, understand that in analyzing search algorithms and the memory consumed by the algorithm can become critically important; understand that the meaning in formal logic is related to the set of worlds where the given sentence is true; understand that probabilistic reasoning provides a way to handle the default and uncertain status of most real world knowledge, show they are familiar with planning with state-space search; show they know partial order planning; understand and analyze the performance of sliding window protocols; understand at least 3 methods for doing classification learning, and the tradeoffs offered by those methods; and understand the role of bias in making learning tractable.
Prerequisites:
|
Line numbers:
|
Office Hours: MW 5:00 - 6:00pm, BYE 566 |
TA and His Office Hours: Mr. Ali Abbasi, mabbasi2 at asu.edu
and Reza Zafarani, reza at au.edu |
A good reference book on Lisp: ANSI Common Lisp by Paul
Graham, Prentice Hall
"Aoccdrnig to rscheearch at
Cmabrigde Uinervtisy, it deosn't mttaer in waht oredr the ltteers in a wrod
are, the olny iprmoetnt tihng is taht the frist and lsat ltteer be at the rghit
pclae. The rset can be a total mses and you can sitll raed it wouthit a
porbelm. Tihs is bcuseae the huamn mnid deos not raed ervey lteter by istlef,
but the wrod as a wlohe."
o Torrey Stevens - AI mailing list
o Andrew Lasak - Robot Vacuum Cleaners
o Aleks Yasnogorodskiy - Deep Fritz (Final Score: 4-4)
o Daniele "Esaurito" Pagano - Performance of Lisp
o Daniele "Esaurito" Pagano - SHRDLU resurrection (an NLP program of the block world)
o recommended by a friend - The Evolution of a Programmer
Created: 07/07/2009
Last updated: 07/07/2009
Counselor
Training Center - The First Step to Well Being
If you have comments or suggestions, email me at