Přístupnostní navigace
E-application
Search Search Close
Course detail
FIT-IZUAcad. year: 2018/2019
Problem solving: State space search (BFS, DFS, DLS, IDS, BS, UCS, Backtracking, Forward checking, Min-conflict, BestFS, GS, A*, Hill Climbing, Simulated Annealing methods). Problem decomposition (AND/OR graphs). Solving optimization problems by nature-inspired algorithms (GA, ACO and PSO). Games playing (Mini-Max and Alfa-Beta algorithms). Logic and artificial intelligence (method of resolution and its utilization for task solving and planning). PROLOG language and implementations of basic search algorithms in this language. Machine learning principles. Classification and patterns recognition. Basic principles of expert systems. Fundamentals of computer vision. Principles of natural language processing. Introduction into agent systems.
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 reading
Classification of course in study plans
branch BIT , 2 year of study, summer semester, compulsory
Lecture
Teacher / Lecturer
Syllabus
Exercise in computer lab