Přístupnostní navigace
E-application
Search Search Close
Course detail
FIT-IZUAcad. year: 2013/2014
Problem solving: State space search (BFS, DFS, DLS, IDS, BS, UCS, Backtracking, Forward checking, Min-conflict, BestFS, GS, A*, Hill Climbing, Simulated annealing methods). Solving of optimization problems using algorithms inspired by nature (GA, ACO and PSO). Problem decomposition (And Or graphs), games playing (Mini-Max and Alfa-Beta algorithms). Knowledge representation - basic schemes. AI languages (PROLOG, LISP) and implementations of basic search algorithms in these languages. Machine learning principles. Statistical and structural pattern recognition. Fundamentals of computer vision. Base principles of natural language processing. Application fields of artificial intelligence.
Language of instruction
Number of ECTS credits
Mode of study
Guarantor
Department
Learning outcomes of the course unit
Prerequisites
Co-requisites
Planned learning activities and teaching methods
Assesment methods and criteria linked to learning outcomes
Course curriculum
Work placements
Aims
Specification of controlled education, way of implementation and compensation for absences
Recommended optional programme components
Prerequisites and corequisites
Basic literature
Recommended literature
Classification of course in study plans
branch BIT , 2 year of study, summer semester, compulsory
Lecture
Teacher / Lecturer
Syllabus
Exercise in computer lab
E-learning texts