Credit points: 3.0
Heuristic methods for search in problem spaces. Search in game trees. Methods for knowledge representation using: logic,semantic networks, frame systems, probabilistic networks.Additional possible topics: learning systems, natural language processing, expert systems, planning.
| <IMG height=1 src="http://grades.cs.technion.ac.il/Images/spacer.gif" width=1> |
</strong>
General Rules
- The slides are available for downloading as a service to the students. The material considered as the course content is the material taught in the lectures and recitations. It is possible that some of the material is not included in the slides and it is the students' responsibility to make sure that they have updated material.
- The programming assignments can be done by individuals or by pairs. Each pair should design and write the exercises ALONE without consulting others.
- Students who are going to Miluim should coordinate the submission time with the assistants BEFORE they go to service.
- Any complaints about assignment grade should be specified up to two weeks after the grades for the exercise are published.
</strong>
Grading policy
The following pseudo code captures the formula for calculating the final grade of the course:
if (exam_grade > 45) then
final_grade = 0.6*exam_grade + 0.4*hw_grade
else
final_grade = exam_grade