Index of /~pmiki/AI Berkeley/edx AI

[ICO]NameLast modifiedSizeDescription

[DIR]Parent Directory  -
[VID]CS188 Step-by-Step Examples- A Star Search.mp413-Oct-2016 11:52 68M
[VID]CS188 Step-by-Step Examples- Depth First Tree Search and Breadth First Tree Search.mp413-Oct-2016 11:52 22M
[VID]Lecture 1 Segment 1 Outline of Lecture 1.mp413-Oct-2016 11:52 3.0M
[VID]Lecture 1 Segment 10 What can AI do Robotics.mp413-Oct-2016 11:52 55M
[VID]Lecture 1 Segment 11 What can AI do Logic.mp413-Oct-2016 11:52 6.9M
[VID]Lecture 1 Segment 12 Game Playing.mp413-Oct-2016 11:52 15M
[VID]Lecture 1 Segment 13 What can AI do- Decision Making.mp413-Oct-2016 11:52 10M
[VID]Lecture 1 Segment 14 Designing Rational Agent.mp413-Oct-2016 11:52 9.5M
[VID]Lecture 1 Segment 15 Pacman as an Agent.mp413-Oct-2016 11:52 9.5M
[VID]Lecture 1 Segment 16 Course Topics.mp413-Oct-2016 11:52 4.0M
[VID]Lecture 1 Segment 2 Sci-Fi AI.mp413-Oct-2016 11:52 13M
[VID]Lecture 1 Segment 3 What is AI.mp413-Oct-2016 11:52 23M
[VID]Lecture 1 Segment 4 What about the brain.mp413-Oct-2016 11:52 9.1M
[VID]Lecture 1 Segment 5 A (Short) History of AI.mp413-Oct-2016 11:53 54M
[VID]Lecture 1 Segment 6 What can AI do.mp413-Oct-2016 11:53 29M
[VID]Lecture 1 Segment 7 Unintentionally Funny Stories.mp413-Oct-2016 11:53 27M
[VID]Lecture 1 Segment 8 What can AI do Language.mp413-Oct-2016 11:53 19M
[VID]Lecture 1 Segment 9 What can AI do Perception.mp413-Oct-2016 11:53 27M
[VID]Lecture 10 Segment 1 Reinforcement Learning.mp413-Oct-2016 11:53 51M
[VID]Lecture 10 Segment 2 Model-Based Learning.mp413-Oct-2016 11:53 32M
[VID]Lecture 10 Segment 3 Passive Reinforcement Learning.mp413-Oct-2016 11:54 45M
[VID]Lecture 10 Segment 4 Model-Free Learning Sample Based - Temporal Difference Learning.mp413-Oct-2016 11:54 60M
[VID]Lecture 10 Segment 5 Active Reinforcement Learning - Q-Learning.mp413-Oct-2016 11:54 51M
[VID]Lecture 11 Segment 1 Reinforcement Learning Recap.mp413-Oct-2016 11:54 55M
[VID]Lecture 11 Segment 2 Exploration vs. Exploitation and Regret.mp413-Oct-2016 11:54 32M
[VID]Lecture 11 Segment 3 Approximate Q-Learning.mp413-Oct-2016 11:55 84M
[VID]Lecture 11 Segment 4 Policy Search.mp413-Oct-2016 11:55 17M
[VID]Lecture 11 Segment 5 Conclusion.mp413-Oct-2016 11:55 3.0M
[VID]Lecture 12- Probability.mp413-Oct-2016 11:56 235M
[VID]Lecture 2 Quiz 11 Maze Search Demos Part 2.mp413-Oct-2016 11:58 1.4M
[VID]Lecture 13- Bayes Nets.mp413-Oct-2016 11:58 224M
[VID]Lecture 2 Quiz 11 Maze Search Demos Part 4.mp413-Oct-2016 11:58 1.1M
[VID]Lecture 2 Quiz 11 Maze Search Demos Part 5.mp413-Oct-2016 11:58 629K
[VID]Lecture 2 Quiz 2 Safe Passage Answer.mp413-Oct-2016 11:58 4.9M
[VID]Lecture 2 Quiz 3 State Space Graphs and Search Trees Answer.mp413-Oct-2016 11:58 2.9M
[VID]Lecture 2 Quiz 8 Relative Advantages of Breadth-First and Depth-First.mp413-Oct-2016 11:58 759K
[VID]Lecture 2 Quiz 8 Relative Advantages of Breadth-First and Depth-First Answer.mp413-Oct-2016 11:58 2.0M
[VID]Lecture 2 Quiz 9 Search Demo Part 2.mp413-Oct-2016 11:58 1.3M
[VID]Lecture 2 Quiz 9 Search Demo Part 4.mp413-Oct-2016 11:58 1.5M
[VID]Lecture 2 Segment 1 Today.mp413-Oct-2016 11:58 5.7M
[VID]Lecture 2 Segment 10 Breadth First Tree Search Properties.mp413-Oct-2016 11:58 8.9M
[VID]Lecture 2 Segment 11 Iterative Deepening.mp413-Oct-2016 11:58 3.6M
[VID]Lecture 2 Segment 12 Cost-Sensitive Search Uniform Cost Search.mp413-Oct-2016 11:58 26M
[VID]Lecture 2 Segment 13 Search and Models.mp413-Oct-2016 11:58 10M
[VID]Lecture 2 Segment 2 Agents that Plan vs. Reflex Agents.mp413-Oct-2016 11:58 19M
[VID]Lecture 2 Segment 3 Search Problems.mp413-Oct-2016 11:58 20M
[VID]Lecture 2 Segment 4 State Space Graphs and Search Trees.mp413-Oct-2016 11:58 22M
[VID]Lecture 2 Segment 5 Tree Search.mp413-Oct-2016 11:58 22M
[VID]Lecture 2 Segment 6 Depth First Tree Search.mp413-Oct-2016 11:59 12M
[VID]Lecture 2 Segment 7 Search Algorithm Properties.mp413-Oct-2016 11:59 6.9M
[VID]Lecture 2 Segment 8 Depth First Search Properties.mp413-Oct-2016 11:59 5.7M
[VID]Lecture 2 Segment 9 Breadth First Tree Search.mp413-Oct-2016 11:59 4.3M
[VID]Lecture 3 Quiz 7 Search Algorithms Part 2.mp413-Oct-2016 11:59 1.1M
[VID]Lecture 3 Quiz 7 Search Algorithms Part 4.mp413-Oct-2016 11:59 687K
[VID]Lecture 3 Quiz 7 Search Algorithms Part 6.mp413-Oct-2016 11:59 716K
[VID]Lecture 3 Quiz 7 Search Algorithms Part 8.mp413-Oct-2016 11:59 565K
[VID]Lecture 3 Quiz 7 Search Algorithms Part 10.mp413-Oct-2016 11:59 1.2M
[VID]Lecture 3 Segment 1 Overview of Today.mp413-Oct-2016 11:59 5.4M
[VID]Lecture 3 Segment 10 Creating Admissible Heuristics.mp413-Oct-2016 11:59 47M
[VID]Lecture 3 Segment 11 Semi-Lattice of Heuristics.mp413-Oct-2016 11:59 9.1M
[VID]Lecture 3 Segment 12 Graph Search.mp413-Oct-2016 11:59 18M
[VID]Lecture 3 Segment 13 Optimality of A.mp413-Oct-2016 11:59 11M
[VID]Lecture 3 Segment 14 A Consistency.mp413-Oct-2016 11:59 13M
[VID]Lecture 3 Segment 15 Optimality Summary.mp413-Oct-2016 11:59 5.1M
[VID]Lecture 3 Segment 16 A Summary.mp413-Oct-2016 11:59 1.6M
[VID]Lecture 3 Segment 2 Recap of Search.mp413-Oct-2016 11:59 40M
[VID]Lecture 3 Segment 3 Informed Search and Search Heuristics.mp413-Oct-2016 11:59 19M
[VID]Lecture 3 Segment 4 Greedy Search.mp413-Oct-2016 12:00 23M
[VID]Lecture 3 Segment 5 A Tree Search Algorithm.mp413-Oct-2016 12:00 18M
[VID]Lecture 3 Segment 6 Admissible Heuristics and A Optimality.mp413-Oct-2016 12:00 20M
[VID]Lecture 3 Segment 7 A Tree Search Proof.mp413-Oct-2016 12:00 13M
[VID]Lecture 3 Segment 8 Properties of A.mp413-Oct-2016 12:00 5.7M
[VID]Lecture 3 Segment 9 A Applications and Demos.mp413-Oct-2016 12:00 13M
[VID]Lecture 4 Segment 1 Today, and What is Search For.mp413-Oct-2016 12:00 11M
[VID]Lecture 4 Segment 10 Improving Backtracking Overview.mp413-Oct-2016 12:00 3.6M
[VID]Lecture 4 Segment 11 Filtering Forward Checking.mp413-Oct-2016 12:00 22M
[VID]Lecture 4 Segment 12 Filtering Constraint Propogation.mp413-Oct-2016 12:00 5.1M
[VID]Lecture 4 Segment 13 Consistency of a Single Arc.mp413-Oct-2016 12:00 17M
[VID]Lecture 4 Segment 14 Arc Consistency of an Entire CSP.mp413-Oct-2016 12:01 40M
[VID]Lecture 4 Segment 15 Limitations of Arc Consistency.mp413-Oct-2016 12:01 9.0M
[VID]Lecture 4 Segment 16 Demo of Forward Checking and Arc Consistency.mp413-Oct-2016 12:01 13M
[VID]Lecture 4 Segment 17 Variable Ordering Minimum Remaining Values.mp413-Oct-2016 12:01 10M
[VID]Lecture 4 Segment 18 Value Ordering Least Constraining Value.mp413-Oct-2016 12:01 8.7M
[VID]Lecture 4 Segment 19 Demo.mp413-Oct-2016 12:01 9.2M
[VID]Lecture 4 Segment 2 CSPs Definition.mp413-Oct-2016 12:01 12M
[VID]Lecture 4 Segment 3 CSP Examples Map Coloring and N-Queens.mp413-Oct-2016 12:01 26M
[VID]Lecture 4 Segment 4 Constraint Graphs.mp413-Oct-2016 12:01 9.6M
[VID]Lecture 4 Segment 5 CSP Examples Cryptarithmetic, Sudoku and Waltz.mp413-Oct-2016 12:01 16M
[VID]Lecture 4 Segment 6 Varieties of CSPs and Constraints.mp413-Oct-2016 12:01 10M
[VID]Lecture 4 Segment 7 Real-World CSPs.mp413-Oct-2016 12:01 4.8M
[VID]Lecture 4 Segment 8 Solving CSPs with Standard Search.mp413-Oct-2016 12:02 19M
[VID]Lecture 4 Segment 9 Backtracking Search.mp413-Oct-2016 12:02 19M
[VID]Lecture 5 A Segment 1 Today.mp413-Oct-2016 12:02 2.4M
[VID]Lecture 5 A Segment 10 Iterative Algorithms Min-Conflicts.mp413-Oct-2016 12:02 21M
[VID]Lecture 5 A Segment 11 Performance of Min-Conflicts.mp413-Oct-2016 12:02 11M
[VID]Lecture 5 A Segment 12 Summary of CSPs.mp413-Oct-2016 12:02 4.1M
[VID]Lecture 5 A Segment 2 Refresher CSPs, Backtracking Search, Ordering, Filtering.mp413-Oct-2016 12:02 25M
[VID]Lecture 5 A Segment 3 Arc Consistency, Limitations, K-Consistency.mp413-Oct-2016 12:02 38M
[VID]Lecture 5 A Segment 4 Problem Stucture.mp413-Oct-2016 12:02 19M
[VID]Lecture 5 A Segment 5 Tree-Structured CSPs.mp413-Oct-2016 12:03 5.7M
[VID]Lecture 5 A Segment 6 Algorithm for Tree-Structured CSPs.mp413-Oct-2016 12:03 27M
[VID]Lecture 5 A Segment 7 Claims about Algorithm for Tree-Structured CSPs.mp413-Oct-2016 12:03 17M
[VID]Lecture 5 A Segment 8 Improving Stucture Cutset Conditioning.mp413-Oct-2016 12:03 15M
[VID]Lecture 5 A Segment 9 Tree Decomposition.mp413-Oct-2016 12:03 17M
[VID]Lecture 5 B Segment 1 Local Search.mp413-Oct-2016 12:03 6.7M
[VID]Lecture 5 B Segment 2 Hill Climbing.mp413-Oct-2016 12:03 12M
[VID]Lecture 5 B Segment 3 Simulated Annealing.mp413-Oct-2016 12:03 19M
[VID]Lecture 5 B Segment 4 Genetic Algorithms.mp413-Oct-2016 12:03 13M
[VID]Lecture 5 B Segment 6 Next Time.mp413-Oct-2016 12:03 302K
[VID]Lecture 6 Segment 1 Today and Game Playing State of the Art.mp413-Oct-2016 12:03 22M
[VID]Lecture 6 Segment 2 Adversarial Games.mp413-Oct-2016 12:04 24M
[VID]Lecture 6 Segment 3 Adversarial Search.mp413-Oct-2016 12:04 65M
[VID]Lecture 6 Segment 4 Resource Limits.mp413-Oct-2016 12:04 26M
[VID]Lecture 6 Segment 5 Evaluation Functions.mp413-Oct-2016 12:04 50M
[VID]Lecture 6 Segment 6 Game Tree Pruning.mp413-Oct-2016 12:05 36M
[VID]Lecture 6 Segment 7 Next Time!.mp413-Oct-2016 12:05 944K
[VID]Lecture 7 Quiz Informed Probabilities Answer.mp413-Oct-2016 12:05 10M
[VID]Lecture 7 Quiz Informed Probabilities Question.mp413-Oct-2016 12:05 1.8M
[VID]Lecture 7 Segment 1 Today- Search in the Presence of Uncertainty.mp413-Oct-2016 12:05 7.6M
[VID]Lecture 7 Segment 2 Expectimax Search.mp413-Oct-2016 12:05 49M
[VID]Lecture 7 Segment 3 Probabilities.mp413-Oct-2016 12:05 29M
[VID]Lecture 7 Segment 4 Modeling Assumptions.mp413-Oct-2016 12:05 23M
[VID]Lecture 7 Segment 5 Other Game Types.mp413-Oct-2016 12:05 25M
[VID]Lecture 7 Segment 6 Utilities.mp413-Oct-2016 12:05 30M
[VID]Lecture 7 Segment 7 Rationality.mp413-Oct-2016 12:06 23M
[VID]Lecture 7 Segment 8 Human Utilities.mp413-Oct-2016 12:06 54M
[VID]Lecture 7 Segment 9 Next Time MDPs!.mp413-Oct-2016 12:06 330K
[VID]Lecture 8 Segment 1 Non-Deterministic Search and Markov Decision Process.mp413-Oct-2016 12:06 66M
[VID]Lecture 8 Segment 2 Example Racing.mp413-Oct-2016 12:06 25M
[VID]Lecture 8 Segment 3 Utilities of Sequences.mp413-Oct-2016 12:06 36M
[VID]Lecture 8 Segment 4 Solving MDPs.mp413-Oct-2016 12:07 95M
[VID]Lecture 8 Segment 5 Value Iteration.mp413-Oct-2016 12:07 48M
[VID]Lecture 8 Segment 6 Next Time Policy-Based Methods.mp413-Oct-2016 12:07 532K
[VID]Lecture 9 Segment 1 MDPs Recap.mp413-Oct-2016 12:07 51M
[VID]Lecture 9 Segment 2 The Bellman Equations.mp413-Oct-2016 12:07 33M
[VID]Lecture 9 Segment 3 Policy Methods Policy Evaluation.mp413-Oct-2016 12:08 68M
[VID]Lecture 9 Segment 4 Policy Methods Policy Iteration.mp413-Oct-2016 12:08 39M
[VID]Lecture 9 Segment 5 Double Bandits.mp413-Oct-2016 12:08 41M
[VID]Lecture 9 Segment 6 Next Time Reinforcement Learning.mp413-Oct-2016 12:08 403K
[VID]Step-by-step Example- Alpha-Beta.mp413-Oct-2016 12:08 60M

Apache Server at people.vts.su.ac.rs Port 80