AI

My Table

Unit 2

S No. Course Content:
0 (Problems Solving, Search and Control Strategies)
1 Solving Problems by Searching
2 Study and analysis of various searching algorithms
3 Implementation of Depth-first search
4 Problem-Solving Agents
5 Searching for Solutions
6 Uninformed Search Strategies: Breadth-first search
7 Uniform-cost search
8 Depth-first search
9 Depth-limited search
10 Iterative deepening depth-first search
11 Bi-directional search
12 Informed (Heuristic) Search Strategies: Greedy best-first search
13 A* search: Minimizing the total estimated solution cost
14 Conditions for optimality: Admissibility and consistency
15 Optimality of A*
12 Memory-bounded heuristic search
13 Heuristic Functions
14 Generating admissible heuristics from sub problems: Pattern databases
15 Learning heuristics from experience
16 Beyond Classical Search: Local Search
17 Algorithms and Optimization Problems: Hill-climbing search Simulated annealing
18 Local beam search
19 Genetic algorithms
21 Local Search in Continuous Spaces
22 Searching with Non-deterministic Actions: AND-OR search trees
23 Searching with Partial Observations

Comments

Popular posts from this blog

OpenSolaris and Linux virtual memory and address space structures

Tying top-down and bottom-up object and memory page lookups with the actual x86 page translation and segmentation

OpenSolaris and UNIX System V system administration pragmatics: service startup, dependencies, management, system updates