CS4600 - Introduction to Intelligent Systems
Homework 1 - Decision Trees
Assume that you have the following training examples available:
F1 Example 1 Example 2 Example 3 Example 4 Example 5 Example 6 Example 7 t f t t f t f
F2 t f f f t t t
F3 f
CS4600 - Introduction to Intelligent Systems Fall 2000
Homework 9 - Probabilities and Bayes Nets
Problem 1 Of the entire population, 2% has a certain disease X. A test Y, which indicates whether or not a person has the disease, is not 100% accurate.
CS4600 - Homework 8 - Game Playing
MAX
5
MIN
MAX
1
6
MIN
4
2
4
3
MAX
1. What is the minimax value of the root node of the above game tree? Cross out the node(s) whose value(s) the alpha-beta method never determines, assuming that it alwa
CS4600 - Introduction to Intelligent Systems Fall 2000
Homework 9 - Sample Solution
Problem 1 Of the entire population, 2% has a certain disease X. A test Y, which indicates whether or not a person has the disease, is not 100% accurate. If a person h
Markov Decision Process Models Invent a simple Markov Decision Process Model with the following properties: a) it has a goal state, b) its immediate action costs are all negative, c) all of its actions can result with some probability in the start st
Neural Networks Suppose that a training set contains only a single example, repeated 100 times. In 80 of the 100 cases, the single output value is 1; in the other 20, it is 0. What will a back-propagation network predict for this example, assuming th
CS4600 - Introduction to Intelligent Systems
Homework 6 - Representing Facts with Logic
Translate the following English sentences to First-Order Logic (FOL) using the following predicates: Has(Joe,x), Dog(x), Cat(x), Cute(x), and Scary(x). a) Joe h
CS4600 - Introduction to Intelligent Systems
Homework 5 - Partial-Order Planning
Suppose there is a bomb in your bathroom. Initially, the bomb is armed and the toilet is unclogged. Your goal is to get the bomb disarmed and the toilet unclogged. The
CS4600 - Introduction to Intelligent Systems
Homework 6 - Sample Solution
Write the following sentences in rst-order logic using these literals: Has(Joe,x), Dog(x), Cat(x), Cute(x), Scary(x). a) Joe has a cute dog. x (Has(Joe,x) ^ Dog(x) ^ Cute(x)
This word, by itself, simply means
"with oxygen," but it comes alive when
used as an adjective to describe
exercise. Aerobic exercise is exercise
that is vigorous enough, lasts long
enough and is done regularly enough
to keep the heart and lungs in good
s
CSCI 460 Introduction to Articial Intelligence Fall 2007
Project 2: A* Search Due: October 24, 2007
1
Introduction
In this project, you are required to use C/C+ as the programming language to solve a navigation problem of a game character in a gri
CSCI 460 Introduction to Articial Intelligence Fall 2007
Project 1(b): Articial Neural Network Due: October 4, 2007
1
Introduction
This project gives you an opportunity to apply neural network learning to the problem of face recognition. You will
CS4600 - Introduction to Intelligent Systems
Homework 1 - Decision Trees - Sample Solution
Assume that you have the following training examples available:
F1 Example 1 Example 2 Example 3 Example 4 Example 5 Example 6 Example 7 t f t t f t f
F2 t
Midterm Preparation. The midterm will test all material, not only material after the midterm. Notice that the following questions are a sample of the kind of questions that could be on the midterm. However, they certainty do not cover everything that
Final Preparation. The final will test all material, not only material after the second midterm. Notice that the following questions are a sample of the kind of questions that could be on the final. However, they certainty do not cover everything tha
Midterm Preparation - Second Midterm. Consider the following probabilities. The midterm will focus on topics discussed after the first midterm, including some planning topics (including partial-order planning and SAT planning), game-tree search, know
CS4600 - Introduction to Intelligent Systems
Homework 3 - Search
A (h=5)
1
C (h=4)
3 4
I (h=3)
2 4
E (h=2)
2 4 1
2
J (h=2)
G (h=4)
F (h=2)
K (h=1)
1
M (h=0)
Consider the graph given above. It shows the actual distances between cities on a m
CS4600 - Introduction to Intelligent Systems
Homework 4 - Encoding planning problems STRIPS Planning Tower of Hanoi
This puzzle has three discs, D1, D2, D3, with holes in their centers, and three pegs, A, B, C, on which the discs can be placed. Disc
CS4600 - Introduction to Intelligent Systems
Homework 4 - Sample Solution STRIPS Planning Tower of Hanoi
This puzzle has three discs, D1, D2, D3, with holes in their centers, and three pegs, A, B, C, on which the discs can be placed. Disc D3 is larg
CSCI 460 Introduction to Articial Intelligence Fall 2007
Project 3: Inferences in First-Order Logic Due: November 21, 2007
1
Introduction
In this project, we will use the Wumpus World environment to illustrate various concepts about Articial Intel
Sports Science
Introduction and Background
What is science?
Knowledge about Gods creation
Knowledge about the laws of the nature
What is sport?
All form of of physical activities
Through casual or organised participation
Aim at expressing or improvin