<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/">
	<channel>
		<title><![CDATA[Forum PipFlow - Other]]></title>
		<link>https://pipflow.com/forum/</link>
		<description><![CDATA[Forum PipFlow - https://pipflow.com/forum]]></description>
		<pubDate>Tue, 12 May 2026 17:56:00 +0000</pubDate>
		<generator>MyBB</generator>
		<item>
			<title><![CDATA[AI Approach to Financial Forecasting using Improved Data Representation]]></title>
			<link>https://pipflow.com/forum/Thread-AI-Approach-to-Financial-Forecasting-using-Improved-Data-Representation</link>
			<pubDate>Sun, 16 Apr 2017 03:46:34 +0000</pubDate>
			<dc:creator><![CDATA[<a href="https://pipflow.com/forum/member.php?action=profile&uid=3">waldo</a>]]></dc:creator>
			<guid isPermaLink="false">https://pipflow.com/forum/Thread-AI-Approach-to-Financial-Forecasting-using-Improved-Data-Representation</guid>
			<description><![CDATA[<span style="font-size: large;" class="mycode_size"><span style="font-family: sans-serif;" class="mycode_font">Thesis<br />
<br />
An Artificial Intelligence Approach to Financial Forecasting</span></span><span style="font-size: large;" class="mycode_size"><span style="font-family: sans-serif;" class="mycode_font"> using Improved Data Representation, Multi</span></span><span style="font-size: large;" class="mycode_size"><span style="font-family: sans-serif;" class="mycode_font">-</span></span><span style="font-size: large;" class="mycode_size"><span style="font-family: sans-serif;" class="mycode_font">objective</span></span><span style="font-size: large;" class="mycode_size"><span style="font-family: sans-serif;" class="mycode_font"> Optimization, and Text Mining.</span></span><br />
<br />
Genetic Programmin, Support Vector Machines, Evolutionary Artificial Neural Network, Text mining, Natural Language Processing<br />
<br />
<a href="https://www.cs.dal.ca/sites/default/files/technical_reports/CS-2009-06.pdf" target="_blank" rel="noopener" class="mycode_url">https://www.cs.dal.ca/sites/default/file...009-06.pdf</a>]]></description>
			<content:encoded><![CDATA[<span style="font-size: large;" class="mycode_size"><span style="font-family: sans-serif;" class="mycode_font">Thesis<br />
<br />
An Artificial Intelligence Approach to Financial Forecasting</span></span><span style="font-size: large;" class="mycode_size"><span style="font-family: sans-serif;" class="mycode_font"> using Improved Data Representation, Multi</span></span><span style="font-size: large;" class="mycode_size"><span style="font-family: sans-serif;" class="mycode_font">-</span></span><span style="font-size: large;" class="mycode_size"><span style="font-family: sans-serif;" class="mycode_font">objective</span></span><span style="font-size: large;" class="mycode_size"><span style="font-family: sans-serif;" class="mycode_font"> Optimization, and Text Mining.</span></span><br />
<br />
Genetic Programmin, Support Vector Machines, Evolutionary Artificial Neural Network, Text mining, Natural Language Processing<br />
<br />
<a href="https://www.cs.dal.ca/sites/default/files/technical_reports/CS-2009-06.pdf" target="_blank" rel="noopener" class="mycode_url">https://www.cs.dal.ca/sites/default/file...009-06.pdf</a>]]></content:encoded>
		</item>
		<item>
			<title><![CDATA[Thesis about chess moves generation with FPGA]]></title>
			<link>https://pipflow.com/forum/Thread-Thesis-about-chess-moves-generation-with-FPGA</link>
			<pubDate>Sat, 15 Apr 2017 06:24:58 +0000</pubDate>
			<dc:creator><![CDATA[<a href="https://pipflow.com/forum/member.php?action=profile&uid=3">waldo</a>]]></dc:creator>
			<guid isPermaLink="false">https://pipflow.com/forum/Thread-Thesis-about-chess-moves-generation-with-FPGA</guid>
			<description><![CDATA[This is a diploma thesis from McGill university implementing an FPGA chess move generator for a chess playing program resembling <a href="https://en.wikipedia.org/wiki/Deep_Blue_(chess_computer)" target="_blank" rel="noopener" class="mycode_url">Deep Blue</a>'s specialized ASICs.<br />
<br />
<a href="http://digitool.library.mcgill.ca/webclient/StreamGate?folder_id=0&amp;dvs=1492236580686~696" target="_blank" rel="noopener" class="mycode_url">http://digitool.library.mcgill.ca/webcli...580686~696</a><br />
[url=http://digitool.library.mcgill.ca/webclient/StreamGate?folder_id=0&amp;dvs=1492236580686~696][/url]<br />
This thesis details the use of a programmable logic device to increase the playing strength of a chess program. The time-consuming task of generating chess moves<br />
is relegated to hardware in order to increase the processing speed of the search algorithm. A simpler inter-square connection protocol reduces the number of wires<br />
between chess squares, when compared to the <span style="font-size: small;" class="mycode_size">DEEP BLUE </span>design. With this interconnection scheme, special chess moyes are easily resolved. Furthermore, dynamically<br />
programmable arbiters are introduced for optimal move ordering. Arbiter centrality is also shown to improve move ordering, thereby creating smaller search trees. The<br />
move generator is designed to allow the integration of crucial move ordering heuristics. With its new hardware move generator, the chess program's playing ability is<br />
noticeably improved.]]></description>
			<content:encoded><![CDATA[This is a diploma thesis from McGill university implementing an FPGA chess move generator for a chess playing program resembling <a href="https://en.wikipedia.org/wiki/Deep_Blue_(chess_computer)" target="_blank" rel="noopener" class="mycode_url">Deep Blue</a>'s specialized ASICs.<br />
<br />
<a href="http://digitool.library.mcgill.ca/webclient/StreamGate?folder_id=0&amp;dvs=1492236580686~696" target="_blank" rel="noopener" class="mycode_url">http://digitool.library.mcgill.ca/webcli...580686~696</a><br />
[url=http://digitool.library.mcgill.ca/webclient/StreamGate?folder_id=0&amp;dvs=1492236580686~696][/url]<br />
This thesis details the use of a programmable logic device to increase the playing strength of a chess program. The time-consuming task of generating chess moves<br />
is relegated to hardware in order to increase the processing speed of the search algorithm. A simpler inter-square connection protocol reduces the number of wires<br />
between chess squares, when compared to the <span style="font-size: small;" class="mycode_size">DEEP BLUE </span>design. With this interconnection scheme, special chess moyes are easily resolved. Furthermore, dynamically<br />
programmable arbiters are introduced for optimal move ordering. Arbiter centrality is also shown to improve move ordering, thereby creating smaller search trees. The<br />
move generator is designed to allow the integration of crucial move ordering heuristics. With its new hardware move generator, the chess program's playing ability is<br />
noticeably improved.]]></content:encoded>
		</item>
	</channel>
</rss>