AI Demo
·Îº¿ ¾Ù¸®½º¿Í äÆÃÇÏ·¯°¡±â (ÇÏ´Ü¿¡ äÆÃâ ÀÖÀ½) : ¸®Ã³µå ¿ù¸®½º : ÀÎÅͳݻ󿡼 ´ëÈÇÏ´Â ÇÁ·Î±×·¥À¸·Î »ó´ë ³×ƼÁðÀÌ »ç¶÷À¸·Î Âø°¢ÇÒ ¸¸Å ¹ß´ÞÇß´Ù. ¾Ù¸®½º´Â 4¸¸¿©°¡ÁöÀÇ ´äº¯À» ÅëÇØ ÀÏ»ó´ëÈÀÇ 95%±îÁö ¼ÒÈÇÒ ¼ö ÀÖ°Ô µÆ´Ù. ¸®Ã³µå ¿ù¸®½º´Â 2000³â ¾Ù¸®½º·Î AI °³¹ßÀڵ鿡°Ô´Â °¡Àå ±ÇÀ§ ÀÖ´Â ·Úºê³Ê»ó¿¡ µµÀüÇØ 1µîÀ» Â÷ÁöÇß´Ù.
The Age of Intelligent Machines : The Film : download : Raymond Kurzweil
IDA*search ¸¦ ÀÌ¿ëÇÑ 8 / 15 puzzle
Tools for learning : British Columbia : online resources for Computational Intelligence
Every representation and reasoning system needs a proof procedure in order to be complete. The purpose of this applet is to illustrate how the process of answer extraction within a knowledge base can be cast as a search problem. The deduction applet uses a language similar to Prolog and demonstrates its goal solving procedures.
Graph Searching
Search is an important part of CI;
many problems can be cast as the problem of finding a path in a graph. This
graph-searching applet is designed to help you learn about different search
strategies.
Consistency Based CSP Solver
Constraint
satisfaction problems (CSPs) are pervasive in AI problems. A constraint
satisfaction problem is the problem of assigning values to variables that
satisfy some constraints. This applet lets you investigate arc consistency and
domain splitting with backtracking as ways to solve these problems.
Stochastic Local Search for CSPs
This applet is
designed to help you learn another strategy for solving CSPs. This applet
demonstrates stochastic local search (various mixes of hill climbing and random
moves) that walks through the space of total assignments trying to find an
assignment with minimal error.
Planning
Planning is essential for agents that
act in an environment. To solve a goal intelligently, an agent needs to think
about what it will do now and in the future. This applet demonstrates planning
using the blockworld problem domain and STRIPS representation.
Belief and Decision Networks
Belief networks (also
called Bayesian networks or causal networks) are a representation for
independence amongst random variables for probabilistic reasoning under
uncertainty. The purpose of this applet is to illustrate how probabilities are
updated given new evidence in a belief network, and shows the details of how the
variable elimination algorithm works.
Decision Trees
Learning is the ability to improve
one's behaviour based on experience and represents an important element of
computational intelligence. Decision trees are a simple yet successful technique
for supervised classification learning. This applet demonstrates how to build a
decision tree using a training data set and then use the tree to classify unseen
examples in a test data set.
Neural Networks
Inspired by neurons and their
connections in the brain, neural networks are a representation used in machine
learning. After running the back-propagation learning algorithm on a given set
of examples, the neural network can be used to predict outcomes for any set of
input values.
Robot Control
A robot is an intelligent agent that
perceives, reasons, and acts in time in an environment. It acts to achieve its
assigned goals and at the same time avoids getting into undesired states. The
robot applet provides a simulation of a robot perceiving and acting under the
control of a set of customizable robot controller functions.