Module Name | Download |
---|---|
noc20_cs81_Assignment_01_Week_00 | noc20_cs81_Assignment_01_Week_00 |
noc20_cs81_Assignment_01_Week_01 | noc20_cs81_Assignment_01_Week_01 |
noc20_cs81_Assignment_01_Week_02 | noc20_cs81_Assignment_01_Week_02 |
noc20_cs81_Assignment_01_Week_03 | noc20_cs81_Assignment_01_Week_03 |
noc20_cs81_Assignment_01_Week_04 | noc20_cs81_Assignment_01_Week_04 |
noc20_cs81_Assignment_01_Week_05 | noc20_cs81_Assignment_01_Week_05 |
noc20_cs81_Assignment_01_Week_06 | noc20_cs81_Assignment_01_Week_06 |
noc20_cs81_Assignment_01_Week_07 | noc20_cs81_Assignment_01_Week_07 |
noc20_cs81_Assignment_01_Week_08 | noc20_cs81_Assignment_01_Week_08 |
noc20_cs81_Assignment_01_Week_09 | noc20_cs81_Assignment_01_Week_09 |
noc20_cs81_Assignment_01_Week_10 | noc20_cs81_Assignment_01_Week_10 |
noc20_cs81_Assignment_01_Week_11 | noc20_cs81_Assignment_01_Week_11 |
noc20_cs81_Assignment_01_Week_12 | noc20_cs81_Assignment_01_Week_12 |
Sl.No | Chapter Name | MP4 Download |
---|---|---|
1 | Prologue | Download |
2 | The Winograd Schema Challenge | Download |
3 | Introduction (2013 version) | Download |
4 | Can Machines Think? | Download |
5 | The Turing Test | Download |
6 | Language and Thought | Download |
7 | The Willing Suspension of Disbelief | Download |
8 | Machines with Wheels and Gears | Download |
9 | The Notion of Mind in Philosophy | Download |
10 | Reasoning = Computation | Download |
11 | Concepts and Categories | Download |
12 | How did AI get its name? | Download |
13 | The Chess Saga | Download |
14 | A Brief History of AI | Download |
15 | The Worlds in our Minds | Download |
16 | Epiphemona in Computers | Download |
17 | State Space Search | Download |
18 | Domain Independent Algorithms | Download |
19 | Deterministic Search | Download |
20 | DFS and BFS | Download |
21 | Comparing DFS and BFS | Download |
22 | Depth First Iterative Deepening | Download |
23 | Heuristic Search | Download |
24 | Heuristic Functions and the Search Landscape | Download |
25 | Solution Space Search | Download |
26 | The Traveling Salesman Problem | Download |
27 | Escaping Local Optima | Download |
28 | Stochastic Local Search | Download |
29 | Genetic Algorithms: Survival of the Fittest | Download |
30 | Genetic Algorithms and SAT | Download |
31 | Genetic Algorithms for the TSP | Download |
32 | Emergent Systems | Download |
33 | Ant Colony Optimization | Download |
34 | Finding Optimal Paths | Download |
35 | Branch & Bound | Download |
36 | Algorithm A* | Download |
37 | A*: An illustrated example | Download |
38 | Is A* Admissible? | Download |
39 | Admissibility of A* | Download |
40 | Higher, Faster ... | Download |
41 | B&B - A* - wA* - Best First | Download |
42 | A*: Leaner Admissible Variations | Download |
43 | The Monotone Condition | Download |
44 | DNA Sequence Alignment | Download |
45 | Divide & Conquer Frontier Search. | Download |
46 | Smart Memory Graph Search | Download |
47 | Variations on A*: The story so far | Download |
48 | Breadth First Heuristic Search | Download |
49 | Beam Stack Search | Download |
50 | Game Theory | Download |
51 | Popular Recreational Games | Download |
52 | Board Games and Game Trees | Download |
53 | The Evaluation Function in Board Games | Download |
54 | Algorithm Minimax and Alpha-Beta Pruning | Download |
55 | A Cluster of Strategies | Download |
56 | SSS*: A Best First Algorithm | Download |
57 | SSS*: A Detailed Example | Download |
58 | Automated Domain Independent Planning | Download |
59 | The Blocks World Domain | Download |
60 | State Space Planning: Forward and Backward | Download |
61 | Goal Stack Planning (GSP) | Download |
62 | GSP: A Detailed Example | Download |
63 | Plan Space Planning (PSP) | Download |
64 | PSP: A Tiny Example | Download |
65 | Multi-Armed Robots | Download |
66 | Means-Ends Analysis | Download |
67 | The Planning Graph | Download |
68 | Algorithm Graphplan | Download |
69 | Problem Decomposition. | Download |
70 | Algorithm AO* | Download |
71 | AO*: An Illustration | Download |
72 | Rule Based Expert Systems | Download |
73 | The Inference Engine | Download |
74 | The OPS5 Language | Download |
75 | Conflict Resolution | Download |
76 | Business Rule Management Systems | Download |
77 | The Rete Net | Download |
78 | Rete Algorithm: Optimizing the Match | Download |
79 | Rete Algorithm: Conflict Resolution | Download |
80 | Reasoning in Logic | Download |
81 | Rules of Inference | Download |
82 | Forward Reasoning | Download |
83 | First Order Logic | Download |
84 | Implicit Quantifier Notation | Download |
85 | Backward Reasoning | Download |
86 | Depth First Search on Goal Trees | Download |
87 | Incompleteness... | Download |
88 | Constraint Satisfaction Problems | Download |
89 | Binary Constraint Networks | Download |
90 | Interpreting Line Drawings | Download |
91 | Model Based Diagnosis | Download |
92 | Solving CSPs | Download |
93 | Arc Consistency | Download |
94 | Propagation = Reasoning | Download |
95 | Lookahead Search | Download |
Sl.No | Chapter Name | English |
---|---|---|
1 | Prologue | PDF unavailable |
2 | The Winograd Schema Challenge | PDF unavailable |
3 | Introduction (2013 version) | PDF unavailable |
4 | Can Machines Think? | PDF unavailable |
5 | The Turing Test | PDF unavailable |
6 | Language and Thought | PDF unavailable |
7 | The Willing Suspension of Disbelief | PDF unavailable |
8 | Machines with Wheels and Gears | PDF unavailable |
9 | The Notion of Mind in Philosophy | PDF unavailable |
10 | Reasoning = Computation | PDF unavailable |
11 | Concepts and Categories | PDF unavailable |
12 | How did AI get its name? | PDF unavailable |
13 | The Chess Saga | PDF unavailable |
14 | A Brief History of AI | PDF unavailable |
15 | The Worlds in our Minds | PDF unavailable |
16 | Epiphemona in Computers | PDF unavailable |
17 | State Space Search | PDF unavailable |
18 | Domain Independent Algorithms | PDF unavailable |
19 | Deterministic Search | PDF unavailable |
20 | DFS and BFS | PDF unavailable |
21 | Comparing DFS and BFS | PDF unavailable |
22 | Depth First Iterative Deepening | PDF unavailable |
23 | Heuristic Search | PDF unavailable |
24 | Heuristic Functions and the Search Landscape | PDF unavailable |
25 | Solution Space Search | PDF unavailable |
26 | The Traveling Salesman Problem | PDF unavailable |
27 | Escaping Local Optima | PDF unavailable |
28 | Stochastic Local Search | PDF unavailable |
29 | Genetic Algorithms: Survival of the Fittest | PDF unavailable |
30 | Genetic Algorithms and SAT | PDF unavailable |
31 | Genetic Algorithms for the TSP | PDF unavailable |
32 | Emergent Systems | PDF unavailable |
33 | Ant Colony Optimization | PDF unavailable |
34 | Finding Optimal Paths | PDF unavailable |
35 | Branch & Bound | PDF unavailable |
36 | Algorithm A* | PDF unavailable |
37 | A*: An illustrated example | PDF unavailable |
38 | Is A* Admissible? | PDF unavailable |
39 | Admissibility of A* | PDF unavailable |
40 | Higher, Faster ... | PDF unavailable |
41 | B&B - A* - wA* - Best First | PDF unavailable |
42 | A*: Leaner Admissible Variations | PDF unavailable |
43 | The Monotone Condition | PDF unavailable |
44 | DNA Sequence Alignment | PDF unavailable |
45 | Divide & Conquer Frontier Search. | PDF unavailable |
46 | Smart Memory Graph Search | PDF unavailable |
47 | Variations on A*: The story so far | PDF unavailable |
48 | Breadth First Heuristic Search | PDF unavailable |
49 | Beam Stack Search | PDF unavailable |
50 | Game Theory | PDF unavailable |
51 | Popular Recreational Games | PDF unavailable |
52 | Board Games and Game Trees | PDF unavailable |
53 | The Evaluation Function in Board Games | PDF unavailable |
54 | Algorithm Minimax and Alpha-Beta Pruning | PDF unavailable |
55 | A Cluster of Strategies | PDF unavailable |
56 | SSS*: A Best First Algorithm | PDF unavailable |
57 | SSS*: A Detailed Example | PDF unavailable |
58 | Automated Domain Independent Planning | PDF unavailable |
59 | The Blocks World Domain | PDF unavailable |
60 | State Space Planning: Forward and Backward | PDF unavailable |
61 | Goal Stack Planning (GSP) | PDF unavailable |
62 | GSP: A Detailed Example | PDF unavailable |
63 | Plan Space Planning (PSP) | PDF unavailable |
64 | PSP: A Tiny Example | PDF unavailable |
65 | Multi-Armed Robots | PDF unavailable |
66 | Means-Ends Analysis | PDF unavailable |
67 | The Planning Graph | PDF unavailable |
68 | Algorithm Graphplan | PDF unavailable |
69 | Problem Decomposition. | PDF unavailable |
70 | Algorithm AO* | PDF unavailable |
71 | AO*: An Illustration | PDF unavailable |
72 | Rule Based Expert Systems | PDF unavailable |
73 | The Inference Engine | PDF unavailable |
74 | The OPS5 Language | PDF unavailable |
75 | Conflict Resolution | PDF unavailable |
76 | Business Rule Management Systems | PDF unavailable |
77 | The Rete Net | PDF unavailable |
78 | Rete Algorithm: Optimizing the Match | PDF unavailable |
79 | Rete Algorithm: Conflict Resolution | PDF unavailable |
80 | Reasoning in Logic | PDF unavailable |
81 | Rules of Inference | PDF unavailable |
82 | Forward Reasoning | PDF unavailable |
83 | First Order Logic | PDF unavailable |
84 | Implicit Quantifier Notation | PDF unavailable |
85 | Backward Reasoning | PDF unavailable |
86 | Depth First Search on Goal Trees | PDF unavailable |
87 | Incompleteness... | PDF unavailable |
88 | Constraint Satisfaction Problems | PDF unavailable |
89 | Binary Constraint Networks | PDF unavailable |
90 | Interpreting Line Drawings | PDF unavailable |
91 | Model Based Diagnosis | PDF unavailable |
92 | Solving CSPs | PDF unavailable |
93 | Arc Consistency | PDF unavailable |
94 | Propagation = Reasoning | PDF unavailable |
95 | Lookahead Search | PDF unavailable |
Sl.No | Language | Book link |
---|---|---|
1 | English | Not Available |
2 | Bengali | Not Available |
3 | Gujarati | Not Available |
4 | Hindi | Not Available |
5 | Kannada | Not Available |
6 | Malayalam | Not Available |
7 | Marathi | Not Available |
8 | Tamil | Not Available |
9 | Telugu | Not Available |