<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Artificial Intelligence</title>
	<atom:link href="http://intelligence.worldofcomputing.net/feed" rel="self" type="application/rss+xml" />
	<link>http://intelligence.worldofcomputing.net</link>
	<description>Articles on Artificial Intelligence</description>
	<lastBuildDate>Wed, 17 Mar 2010 11:00:37 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.6</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<item>
		<title>Machine Learning Overview</title>
		<link>http://intelligence.worldofcomputing.net/machine-learning/machine-learning-overview.html</link>
		<comments>http://intelligence.worldofcomputing.net/machine-learning/machine-learning-overview.html#comments</comments>
		<pubDate>Mon, 01 Mar 2010 07:10:13 +0000</pubDate>
		<dc:creator>Robin</dc:creator>
				<category><![CDATA[Machine-Learning]]></category>
		<category><![CDATA[Artificial Intelligence]]></category>

		<guid isPermaLink="false">http://intelligence.worldofcomputing.net/?p=422</guid>
		<description><![CDATA[This article gives an overview of machine learning. This is an introductory article and a starting point to learn the various types of machine learning algorithms.
]]></description>
		<wfw:commentRss>http://intelligence.worldofcomputing.net/machine-learning/machine-learning-overview.html/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Artificial Intelligence Overview</title>
		<link>http://intelligence.worldofcomputing.net/ai-introduction/artificial-intelligence-overview.html</link>
		<comments>http://intelligence.worldofcomputing.net/ai-introduction/artificial-intelligence-overview.html#comments</comments>
		<pubDate>Tue, 16 Feb 2010 14:28:55 +0000</pubDate>
		<dc:creator>Robin</dc:creator>
				<category><![CDATA[AI-Introduction]]></category>
		<category><![CDATA[AI]]></category>
		<category><![CDATA[Artificial Intelligence]]></category>
		<category><![CDATA[Introduction]]></category>

		<guid isPermaLink="false">http://intelligence.worldofcomputing.net/?p=413</guid>
		<description><![CDATA[What is Artificial Intelligence?
Artificial Intelligence (AI) is the study and creation of computer systems that can perceive, reason and act. The primary aim of AI is to produce intelligent machines. The intelligence should be exhibited  by thinking, making decisions, solving problems, more importantly  by learning. AI is an interdisciplinary field that requires knowledge [...]]]></description>
		<wfw:commentRss>http://intelligence.worldofcomputing.net/ai-introduction/artificial-intelligence-overview.html/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Transposition Table</title>
		<link>http://intelligence.worldofcomputing.net/ai-search/transposition-table.html</link>
		<comments>http://intelligence.worldofcomputing.net/ai-search/transposition-table.html#comments</comments>
		<pubDate>Sat, 19 Dec 2009 06:14:34 +0000</pubDate>
		<dc:creator>Robin</dc:creator>
				<category><![CDATA[AI Search]]></category>
		<category><![CDATA[Two-player games]]></category>

		<guid isPermaLink="false">http://intelligence.worldofcomputing.net/?p=261</guid>
		<description><![CDATA[What is Transposition Table?
A transposition table is a table of previously encountered game states, together with their backed-up minimax values. Whenever a new state is generated, if it is stored in the transposition table, its stored value is used instead of searching the tree below the node.
NEXT: Limited Discrepancy Search
]]></description>
		<wfw:commentRss>http://intelligence.worldofcomputing.net/ai-search/transposition-table.html/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Complexity In Heuristic Search</title>
		<link>http://intelligence.worldofcomputing.net/ai-search/complexity-in-heuristic-search.html</link>
		<comments>http://intelligence.worldofcomputing.net/ai-search/complexity-in-heuristic-search.html#comments</comments>
		<pubDate>Sat, 19 Dec 2009 06:12:12 +0000</pubDate>
		<dc:creator>Robin</dc:creator>
				<category><![CDATA[AI Search]]></category>
		<category><![CDATA[Heuristic Search]]></category>

		<guid isPermaLink="false">http://intelligence.worldofcomputing.net/?p=259</guid>
		<description><![CDATA[The time complexity of a heuristic search algorithm depends on the accuracy of the heuristic function. For example, if the heuristic evaluation function is an exact estimator...]]></description>
		<wfw:commentRss>http://intelligence.worldofcomputing.net/ai-search/complexity-in-heuristic-search.html/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Depth First Search</title>
		<link>http://intelligence.worldofcomputing.net/ai-search/depth-first-search.html</link>
		<comments>http://intelligence.worldofcomputing.net/ai-search/depth-first-search.html#comments</comments>
		<pubDate>Sat, 19 Dec 2009 05:38:23 +0000</pubDate>
		<dc:creator>Robin</dc:creator>
				<category><![CDATA[AI Search]]></category>
		<category><![CDATA[Algorithm]]></category>
		<category><![CDATA[Brute-force]]></category>
		<category><![CDATA[Search]]></category>

		<guid isPermaLink="false">http://intelligence.worldofcomputing.net/?p=257</guid>
		<description><![CDATA[Depth-First Search (DFS) searches deeper into the problem space. DFS uses last-in first-out stack  for keeping the unexpanded nodes.  ]]></description>
		<wfw:commentRss>http://intelligence.worldofcomputing.net/ai-search/depth-first-search.html/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Uniform-Cost Search</title>
		<link>http://intelligence.worldofcomputing.net/ai-search/uniform-cost-search.html</link>
		<comments>http://intelligence.worldofcomputing.net/ai-search/uniform-cost-search.html#comments</comments>
		<pubDate>Sat, 19 Dec 2009 05:35:39 +0000</pubDate>
		<dc:creator>Robin</dc:creator>
				<category><![CDATA[AI Search]]></category>
		<category><![CDATA[Algorithm]]></category>
		<category><![CDATA[Brute-force]]></category>
		<category><![CDATA[Search]]></category>

		<guid isPermaLink="false">http://intelligence.worldofcomputing.net/?p=255</guid>
		<description><![CDATA[If all the edges in the search graph do not have the same cost then breadth-first search generalizes to uniform-cost search. Instead of expanding nodes... ]]></description>
		<wfw:commentRss>http://intelligence.worldofcomputing.net/ai-search/uniform-cost-search.html/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Learning Real-Time A Star</title>
		<link>http://intelligence.worldofcomputing.net/ai-search/learning-real-time-a-star.html</link>
		<comments>http://intelligence.worldofcomputing.net/ai-search/learning-real-time-a-star.html#comments</comments>
		<pubDate>Sat, 19 Dec 2009 05:32:18 +0000</pubDate>
		<dc:creator>Robin</dc:creator>
				<category><![CDATA[AI Search]]></category>
		<category><![CDATA[Interleaving]]></category>
		<category><![CDATA[Search]]></category>

		<guid isPermaLink="false">http://intelligence.worldofcomputing.net/?p=253</guid>
		<description><![CDATA[If a problem is to be solved repeatedly  with the same goal state but different intial state then one would like an algorithm that improves its performance over time. Learning Real-Time A* (LRTA*) ...]]></description>
		<wfw:commentRss>http://intelligence.worldofcomputing.net/ai-search/learning-real-time-a-star.html/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Real Time A Star</title>
		<link>http://intelligence.worldofcomputing.net/ai-search/real-time-a-star.html</link>
		<comments>http://intelligence.worldofcomputing.net/ai-search/real-time-a-star.html#comments</comments>
		<pubDate>Sat, 19 Dec 2009 05:30:11 +0000</pubDate>
		<dc:creator>Robin</dc:creator>
				<category><![CDATA[AI Search]]></category>
		<category><![CDATA[Interleaving]]></category>
		<category><![CDATA[Search]]></category>

		<guid isPermaLink="false">http://intelligence.worldofcomputing.net/?p=251</guid>
		<description><![CDATA[Simply repeating minimin search for each move ignores information from previous searches and results in infinite loops. In addition, since actions are committed...]]></description>
		<wfw:commentRss>http://intelligence.worldofcomputing.net/ai-search/real-time-a-star.html/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Minimin Search</title>
		<link>http://intelligence.worldofcomputing.net/ai-search/minimin-search.html</link>
		<comments>http://intelligence.worldofcomputing.net/ai-search/minimin-search.html#comments</comments>
		<pubDate>Sat, 19 Dec 2009 05:29:04 +0000</pubDate>
		<dc:creator>Robin</dc:creator>
				<category><![CDATA[AI Search]]></category>
		<category><![CDATA[Interleaving]]></category>
		<category><![CDATA[Search]]></category>

		<guid isPermaLink="false">http://intelligence.worldofcomputing.net/?p=249</guid>
		<description><![CDATA[Minimin search determines individual single-agent moves in constant time per move. The algorithm searches forward...]]></description>
		<wfw:commentRss>http://intelligence.worldofcomputing.net/ai-search/minimin-search.html/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Interleaving Search</title>
		<link>http://intelligence.worldofcomputing.net/ai-search/interleaving-search.html</link>
		<comments>http://intelligence.worldofcomputing.net/ai-search/interleaving-search.html#comments</comments>
		<pubDate>Sat, 19 Dec 2009 05:27:35 +0000</pubDate>
		<dc:creator>Robin</dc:creator>
				<category><![CDATA[AI Search]]></category>
		<category><![CDATA[Interleaving]]></category>
		<category><![CDATA[Search]]></category>

		<guid isPermaLink="false">http://intelligence.worldofcomputing.net/?p=247</guid>
		<description><![CDATA[In search, there are computational limits and uncertainty due to the opponent's move as in two-players games. So it is wise to have search and execution  interleaved ...]]></description>
		<wfw:commentRss>http://intelligence.worldofcomputing.net/ai-search/interleaving-search.html/feed</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
