<?xml version="1.0" encoding="UTF-8"?>
<!-- generator="FeedCreator 1.8" -->
<?xml-stylesheet href="http://cadia.ru.is/wiki/lib/exe/css.php?s=feed" type="text/css"?>
<rdf:RDF
    xmlns="http://purl.org/rss/1.0/"
    xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"
    xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
    xmlns:dc="http://purl.org/dc/elements/1.1/">
    <channel rdf:about="http://cadia.ru.is/wiki/feed.php">
        <title>Center for Analysis and Design of Intelligent Agents public:t-622-arti-15-1</title>
        <description></description>
        <link>http://cadia.ru.is/wiki/</link>
        <image rdf:resource="http://cadia.ru.is/wiki/lib/tpl/dokuwiki/images/favicon.ico" />
       <dc:date>2026-04-21T06:22:53+00:00</dc:date>
        <items>
            <rdf:Seq>
                <rdf:li rdf:resource="http://cadia.ru.is/wiki/public:t-622-arti-15-1:lab_1_-_agents?rev=1714397608&amp;do=diff"/>
                <rdf:li rdf:resource="http://cadia.ru.is/wiki/public:t-622-arti-15-1:lab_2_-_hashing_states?rev=1714397608&amp;do=diff"/>
                <rdf:li rdf:resource="http://cadia.ru.is/wiki/public:t-622-arti-15-1:lab_3_-_csps?rev=1714397608&amp;do=diff"/>
                <rdf:li rdf:resource="http://cadia.ru.is/wiki/public:t-622-arti-15-1:lab_4_-_propositional_logic?rev=1714397608&amp;do=diff"/>
                <rdf:li rdf:resource="http://cadia.ru.is/wiki/public:t-622-arti-15-1:lab_5_-_bayesian_networks?rev=1714397608&amp;do=diff"/>
                <rdf:li rdf:resource="http://cadia.ru.is/wiki/public:t-622-arti-15-1:lab_6_-_learning_decision_trees?rev=1714397608&amp;do=diff"/>
                <rdf:li rdf:resource="http://cadia.ru.is/wiki/public:t-622-arti-15-1:lab_7_-_particle_filtering?rev=1714397608&amp;do=diff"/>
                <rdf:li rdf:resource="http://cadia.ru.is/wiki/public:t-622-arti-15-1:main?rev=1714397608&amp;do=diff"/>
                <rdf:li rdf:resource="http://cadia.ru.is/wiki/public:t-622-arti-15-1:prog1?rev=1714397608&amp;do=diff"/>
                <rdf:li rdf:resource="http://cadia.ru.is/wiki/public:t-622-arti-15-1:prog2?rev=1714397608&amp;do=diff"/>
            </rdf:Seq>
        </items>
    </channel>
    <image rdf:about="http://cadia.ru.is/wiki/lib/tpl/dokuwiki/images/favicon.ico">
        <title>Center for Analysis and Design of Intelligent Agents</title>
        <link>http://cadia.ru.is/wiki/</link>
        <url>http://cadia.ru.is/wiki/lib/tpl/dokuwiki/images/favicon.ico</url>
    </image>
    <item rdf:about="http://cadia.ru.is/wiki/public:t-622-arti-15-1:lab_1_-_agents?rev=1714397608&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2024-04-29T13:33:28+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>public:t-622-arti-15-1:lab_1_-_agents</title>
        <link>http://cadia.ru.is/wiki/public:t-622-arti-15-1:lab_1_-_agents?rev=1714397608&amp;do=diff</link>
        <description>Lab 1 - Agents

Note: For this lab, you can work together in teams of up to 4 students. You can use Piazza to find team mates and discuss problems.

You will need a Java Development Kit (JDK) and a Java IDE (a text editor should do as well).

Problem Description</description>
    </item>
    <item rdf:about="http://cadia.ru.is/wiki/public:t-622-arti-15-1:lab_2_-_hashing_states?rev=1714397608&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2024-04-29T13:33:28+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>public:t-622-arti-15-1:lab_2_-_hashing_states</title>
        <link>http://cadia.ru.is/wiki/public:t-622-arti-15-1:lab_2_-_hashing_states?rev=1714397608&amp;do=diff</link>
        <description>Lab 2 - Hashing States

Note: For this lab, you can work together in teams of up to 4 students. However, this is not a necessity. The assignment is small enough to do it alone in which case you may get more experience. You can use Piazza to find team members and discuss problems.</description>
    </item>
    <item rdf:about="http://cadia.ru.is/wiki/public:t-622-arti-15-1:lab_3_-_csps?rev=1714397608&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2024-04-29T13:33:28+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>public:t-622-arti-15-1:lab_3_-_csps</title>
        <link>http://cadia.ru.is/wiki/public:t-622-arti-15-1:lab_3_-_csps?rev=1714397608&amp;do=diff</link>
        <description>Lab 3 - Constraint Satisfaction Problems

Note: For this lab, you can work together in teams of up to 4 students. However, this is not a necessity. The assignment is small enough to do it alone in which case you may get more experience. You can use Piazza to find team members and discuss problems.</description>
    </item>
    <item rdf:about="http://cadia.ru.is/wiki/public:t-622-arti-15-1:lab_4_-_propositional_logic?rev=1714397608&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2024-04-29T13:33:28+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>public:t-622-arti-15-1:lab_4_-_propositional_logic</title>
        <link>http://cadia.ru.is/wiki/public:t-622-arti-15-1:lab_4_-_propositional_logic?rev=1714397608&amp;do=diff</link>
        <description>Lab 4 - Propositional Logic / Inference

Problem Description

(Based on “The Adventure of Silver Blaze,” an original Sherlock Holmes mystery by Arthur Conan Doyle)

A prize-winning racehorse named Silver Blaze has been stolen from a stable, and a bookmaker named Fitzroy Simpson has been arrested as the prime suspect by good old Inspector Gregory. Sherlock Holmes, however, after ample use of his magnifying glass and some of the strongest black tobacco this side of the Atlantic, finds the true thi…</description>
    </item>
    <item rdf:about="http://cadia.ru.is/wiki/public:t-622-arti-15-1:lab_5_-_bayesian_networks?rev=1714397608&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2024-04-29T13:33:28+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>public:t-622-arti-15-1:lab_5_-_bayesian_networks</title>
        <link>http://cadia.ru.is/wiki/public:t-622-arti-15-1:lab_5_-_bayesian_networks?rev=1714397608&amp;do=diff</link>
        <description>Lab 5: Bayesian Networks

In this session we will look at some basic Bayesian Networks and you will solve two problems using a Bayesian Network simulator.
You can work together in groups. Hand in the results in MySchool.

Material

Here are two different Bayesian Network simulations that you can use:</description>
    </item>
    <item rdf:about="http://cadia.ru.is/wiki/public:t-622-arti-15-1:lab_6_-_learning_decision_trees?rev=1714397608&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2024-04-29T13:33:28+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>public:t-622-arti-15-1:lab_6_-_learning_decision_trees</title>
        <link>http://cadia.ru.is/wiki/public:t-622-arti-15-1:lab_6_-_learning_decision_trees?rev=1714397608&amp;do=diff</link>
        <description>Learning Decision Trees

Material:

	*  [java project]
	*  javadoc for the framework

The zip archive contains three data sets and Java code to learn a decision tree from those data sets. Your task is to check how well the learning algorithm performs on the given data sets.

Tasks:

	*  Change the existing code (changing the main method should do), so that it prints the necessary data for a learning curve to standard output. That is, change the code such that it learns trees for increasing numbe…</description>
    </item>
    <item rdf:about="http://cadia.ru.is/wiki/public:t-622-arti-15-1:lab_7_-_particle_filtering?rev=1714397608&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2024-04-29T13:33:28+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>public:t-622-arti-15-1:lab_7_-_particle_filtering</title>
        <link>http://cadia.ru.is/wiki/public:t-622-arti-15-1:lab_7_-_particle_filtering?rev=1714397608&amp;do=diff</link>
        <description>Lab 7: Particle Filter

In this session we will look at how to use particle filtering for localization of a robot.

Material

Download the following file: 

It includes:

	*  Source code for a simple robot simulator
	*  A skeleton for a particle filter algorithm (ParticleFilter.java)</description>
    </item>
    <item rdf:about="http://cadia.ru.is/wiki/public:t-622-arti-15-1:main?rev=1714397608&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2024-04-29T13:33:28+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>public:t-622-arti-15-1:main</title>
        <link>http://cadia.ru.is/wiki/public:t-622-arti-15-1:main?rev=1714397608&amp;do=diff</link>
        <description>T-622-ARTI, Introduction to Artificial Intelligence, Spring 2015

Description

Artificial Intelligence (AI) is devoted to the computational study of intelligent behaviour, including areas such as problem solving, knowledge representation, reasoning, planning and scheduling, machine learning, perception and communication. This course gives an overview of the aforementioned AI subfields from a computer science perspective and introduces fundamental solution techniques for addressing them. An impor…</description>
    </item>
    <item rdf:about="http://cadia.ru.is/wiki/public:t-622-arti-15-1:prog1?rev=1714397608&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2024-04-29T13:33:28+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>public:t-622-arti-15-1:prog1</title>
        <link>http://cadia.ru.is/wiki/public:t-622-arti-15-1:prog1?rev=1714397608&amp;do=diff</link>
        <description>Programming Assignment 1 - Search

Use the Piazza page, if you have any questions or problems with the assignment. Start early, so you still have time to ask in case of problems!

You can work on this assignment in a group (up to 4 students per group).

Problem Description</description>
    </item>
    <item rdf:about="http://cadia.ru.is/wiki/public:t-622-arti-15-1:prog2?rev=1714397608&amp;do=diff">
        <dc:format>text/html</dc:format>
        <dc:date>2024-04-29T13:33:28+00:00</dc:date>
        <dc:creator>Anonymous (anonymous@undisclosed.example.com)</dc:creator>
        <title>public:t-622-arti-15-1:prog2</title>
        <link>http://cadia.ru.is/wiki/public:t-622-arti-15-1:prog2?rev=1714397608&amp;do=diff</link>
        <description>Programming Assignment 2 - Adversarial Search

Use Piazza or email me, if you have any questions or problems with the assignment. Start early, so you still have time to ask in case of problems!

Problem Description

Implement an agent that is able to play</description>
    </item>
</rdf:RDF>
