﻿<?xml version="1.0" encoding="utf-8"?><rss version="2.0"><channel><title>Wiki on technique</title><link>http://www.DailyFreeCode.Com</link><description>Wiki on technique - DailyFreeCode.Com</description><copyright>Copyright @ 2010. All rights reserved.</copyright><item><title>Artificial Intelligence and Expert Systems, Problems of AI domain and AI techniques </title><link>http://www.DailyFreeCode.Com/Code/artificial-intelligence-expert-systems-3329.aspx</link><pubDate>Fri, 22 Jul 2011 13:52:16 GMT</pubDate></item><item><title>Prolog program of 8-puzzle using heuristic function % with best first search technique</title><link>http://www.DailyFreeCode.Com/Code/prolog-8-puzzle-heuristic-function-3105.aspx</link><pubDate>Mon, 21 Feb 2011 17:32:15 GMT</pubDate></item><item><title>Functional decomposition technique can be used to implement - Select option</title><link>http://www.DailyFreeCode.Com/InterviewFAQ/functional-decomposition-technique-544.aspx</link><pubDate>Wed, 15 Dec 2010 10:15:00 GMT</pubDate></item><item><title>Program describes how to use Sort technique</title><link>http://www.DailyFreeCode.Com/Code/describes-sort-technique-1860.aspx</link><pubDate>Tue, 07 Sep 2010 00:00:00 GMT</pubDate></item><item><title>Define File Organization technique in dfs (data file structure). </title><link>http://www.DailyFreeCode.Com/InterviewFAQ/define-file-organization-technique-dfs-136.aspx</link><pubDate>Mon, 23 Aug 2010 00:00:00 GMT</pubDate></item><item><title>Program to count the total no of characters in one or more character strings by any parallel technique</title><link>http://www.DailyFreeCode.Com/Code/count-total-no-characters-character-1110.aspx</link><pubDate>Sat, 24 Jul 2010 00:00:00 GMT</pubDate></item><item><title>Program to count the total no of characters in one or more character strings by any parallel technique</title><link>http://www.DailyFreeCode.Com/Code/count-total-no-characters-character-2158.aspx</link><pubDate>Thu, 01 Jul 2010 00:00:00 GMT</pubDate></item><item><title>PROGRAM TO APPLY BLOCK SCHEDULING TECHNIQUE TO SOLVE FOLLOWING EXPRESSION X[I] = X[I+1] + Y[I]</title><link>http://www.DailyFreeCode.Com/Code/apply-block-scheduling-technique-solve-2085.aspx</link><pubDate>Tue, 20 Apr 2010 00:00:00 GMT</pubDate></item><item><title>Program for block scheduling technique to solve following expression x[i]=x[i+1]+y[i]</title><link>http://www.DailyFreeCode.Com/Code/block-scheduling-technique-solve-2084.aspx</link><pubDate>Mon, 19 Apr 2010 00:00:00 GMT</pubDate></item><item><title>Program for block scheduling technique to solve following expression x[i]=x[i+1]</title><link>http://www.DailyFreeCode.Com/Code/block-scheduling-technique-solve-2083.aspx</link><pubDate>Sun, 18 Apr 2010 00:00:00 GMT</pubDate></item><item><title>Help in Rmi call back technique</title><link>http://www.DailyFreeCode.Com/Forum/help-rmi-call-back-technique-21240.aspx</link><pubDate>Fri, 16 Apr 2010 00:00:00 GMT</pubDate></item><item><title>Program describes sorting technique</title><link>http://www.DailyFreeCode.Com/Code/describes-sorting-technique-1867.aspx</link><pubDate>Sun, 24 Jan 2010 00:00:00 GMT</pubDate></item><item><title>Program shows the sequential searching technique</title><link>http://www.DailyFreeCode.Com/Code/shows-sequential-searching-technique-1866.aspx</link><pubDate>Sat, 19 Sep 2009 00:00:00 GMT</pubDate></item><item><title>Program shows the sequential searching technique</title><link>http://www.DailyFreeCode.Com/Code/shows-sequential-searching-technique-1856.aspx</link><pubDate>Sat, 21 Feb 2009 00:00:00 GMT</pubDate></item><item><title>Program to computes the n_th term of the fibonacci series using   Dynamic Programming Technique</title><link>http://www.DailyFreeCode.Com/Code/computes-n_th-term-fibonacci-series-840.aspx</link><pubDate>Tue, 13 Jan 2009 00:00:00 GMT</pubDate></item><item><title>Program to computes the n_th term of the fibonacci series using  Toplogical Odering and Dynamic Programming Technique</title><link>http://www.DailyFreeCode.Com/Code/computes-n_th-term-fibonacci-series-841.aspx</link><pubDate>Sat, 13 Sep 2008 00:00:00 GMT</pubDate></item></channel></rss>