Find Your Courses

Mod-01 Lec-01 Artificial Intelligence-Introduction

 Duration 0h 57m

Mod-01 Lec-02 Introduction to AI

 Duration 0h 52m

Mod-01 Lec-03 AI Introduction Philosophy

 Duration 0h 45m

Mod-01 Lec-04 AI Introduction

 Duration 0h 54m

Mod-01 Lec-05 Introduction Philosophy

 Duration 0h 36m

Mod-01 Lec-06 State Space Search Intro

 Duration 0h 55m

Mod-01 Lec-07 Search-DFS and BFS

 Duration 0h 55m

Mod-01 Lec-8 Search DFID

 Duration 0h 52m

Mod-01 Lec-9 Heuristic Search

 Duration 0h 56m

Mod-01 Lec-10 Hill Climbing

 Duration 0h 45m

Mod-01 Lec-11 Solution Space Search,Beam Search

 Duration 0h 43m

Mod-01 Lec-12 TSP Greedy Methods

 Duration 0h 53m

Mod-01 Lec-13 Tabu Search

 Duration 0h 39m

Mod-01 Lec-14 Optimization I (Simulated Annealing)

 Duration 0h 49m

Mod-01 Lec-15 Optimization II (Genetic Algorithms)

 Duration 0h 54m

Mod-01 Lec-16 Population Based Methods for Optimization

 Duration 0h 52m

Mod-01 Lec-17 Population Based Methods II

 Duration 0h 59m

Mod-01 Lec-18 Branch and Bound,Dijkstras Algorithm

 Duration 0h 57m

Mod-01 Lec-19 A star Algorithm

 Duration 0h 50m

Mod-01 Lec-20 Admissibility of A star

 Duration 0h 52m

Mod-01 Lec-21 A star Monotone Property, Iteractive Deeping A star

 Duration 0h 47m

Mod-01 Lec-22 Recursive Best First Search, Sequence Alignment

 Duration 0h 50m

Mod-01 Lec-23 Pruning the Open and Closed Lists

 Duration 0h 51m

Mod-01 Lec-24 Problem Decomposition with goal Trees

 Duration 0h 49m

Mod-01 Lec-25 AO star Algorithm

 Duration 0h 48m

Mod-01 Lec-26 Game Playing

 Duration 0h 45m

Mod-01 Lec-27 Game Playing Minimax Search

 Duration 0h 46m

Mod-01 Lec-28 Game Playing AlphaBeta

 Duration 0h 48m

Mod-01 Lec-29 Game Playing SSS

 Duration 0h 51m

Mod-01 Lec-30 Rule Based Systems

 Duration 0h 48m

Mod-01 Lec-31 Inference Engines

 Duration 0h 42m

Mod-01 Lec-32 Rete Algorithm

 Duration 0h 50m

Mod-01 Lec-33 Planning

 Duration 0h 51m

Mod-01 Lec-34 Planning FSSP,BSSP

 Duration 0h 54m

Mod-01 Lec-35 Goal Stack Planning Sussman Anomaly

 Duration 0h 51m

Mod-01 Lec-36 Non Linear Planning

 Duration 0h 46m

Mod-01 Lec-37 Plan Space Planning

 Duration 0h 51m

Mod-01 Lec-38 Graph Plan

 Duration 0h 48m

Mod-01 Lec-39 Constraint Satisfaction Problems

 Duration 0h 52m

Mod-01 Lec-40 CSP Continued

 Duration 0h 50m

Mod-01 Lec-41 Knowlege Based Systems

 Duration 0h 54m

Mod-01 Lec-42 Knowledge Based Systems PL

 Duration 0h 50m

Mod-01 Lec-43 Propositional Logic

 Duration 0h 49m

Mod-01 Lec- 44 Resolution Refutation for PL

 Duration 0h 42m

Mod-01 Lec-45 First Order Logic (FOL)

 Duration 0h 53m

Mod-01 Lec-46 Reasoning in FOL

 Duration 0h 50m

Mod-01 Lec-47 Backward Chaining

 Duration 0h 54m

Mod-01 Lec-48 Resolution for FOL

 Duration 0h 47m