<?xml version="1.0" encoding="iso-8859-1"?>
<rss version="2.0">
  <channel>
    <title>DotNetKicks.com : Stories kicked by leniel</title>
    <description>Stories kicked by leniel</description>
    <link>http://www.dotnetkicks.com/</link>
    <language>en-us</language>
    <copyright>Atweb Publishing Ltd.</copyright>
    <docs>http://backend.userland.com/rss</docs>
    <generator>DotNetKicks.com - .NET links, community driven</generator>
    <ttl>30</ttl>
    <item>
      <title>Enterprise Management Software</title>
      <description>The crescent demand for enterprise management software has as key factor big companies, which need to manage millions of records trying with that: find a better way of working with so great amount of information available in their huge databases and get to the target of their business. How this kind of software is used and what to expect from the future? Some thoughts about it. &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;a href="http://www.dotnetkicks.com/kick/?url=http%3a%2f%2flenielmacaferi.blogspot.com%2f2008%2f06%2fenterprise-management-software.html"&gt;&lt;img src="http://www.dotnetkicks.com/Services/Images/KickItImageGenerator.ashx?url=http%3a%2f%2flenielmacaferi.blogspot.com%2f2008%2f06%2fenterprise-management-software.html" border="0" alt="kick it on DotNetKicks.com" /&gt;&lt;/a&gt;
</description>
      <link>http://www.dotnetkicks.com/other/Enterprise_Management_Software</link>
      <guid isPermaLink="true">http://www.dotnetkicks.com/other/Enterprise_Management_Software</guid>
      <pubDate>Thu, 19 Jun 2008 16:35:47 GMT</pubDate>
    </item>
    <item>
      <title>Quicksort and Binary Search algorithms in C++</title>
      <description>This is about a paper entitled Quicksort and Binary Search Algorithms. A fantastic subject that is used throughout the the computer science filed. In the paper you'll see the intrinsic nature of each algorithm as well as a functional implementation of such algorithms in the C++ programming language. Both algorithms perform well in huge data sets. &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;a href="http://www.dotnetkicks.com/kick/?url=http%3a%2f%2flenielmacaferi.blogspot.com%2f2008%2f05%2fquicksort-binary-search-algorithms-c.html"&gt;&lt;img src="http://www.dotnetkicks.com/Services/Images/KickItImageGenerator.ashx?url=http%3a%2f%2flenielmacaferi.blogspot.com%2f2008%2f05%2fquicksort-binary-search-algorithms-c.html" border="0" alt="kick it on DotNetKicks.com" /&gt;&lt;/a&gt;
</description>
      <link>http://www.dotnetkicks.com/other/Quicksort_and_Binary_Search_algorithms_in_C</link>
      <guid isPermaLink="true">http://www.dotnetkicks.com/other/Quicksort_and_Binary_Search_algorithms_in_C</guid>
      <pubDate>Wed, 21 May 2008 21:18:56 GMT</pubDate>
    </item>
    <item>
      <title>Get-capture-edit your screen with SnagIt</title>
      <description>Ever wondered how to capture your computer screen without the need of having to do a post image processing as cropping the parts that don't matter? Well, your problems will come to an end when working with screen capture. Try SnagIt and you'll see how easy and fast it is when what you want is to get a screenshot. You can even edit the screenshot. &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;a href="http://www.dotnetkicks.com/kick/?url=http%3a%2f%2flenielmacaferi.blogspot.com%2f2008%2f05%2fget-capture-edit-screen-with-snagit.html"&gt;&lt;img src="http://www.dotnetkicks.com/Services/Images/KickItImageGenerator.ashx?url=http%3a%2f%2flenielmacaferi.blogspot.com%2f2008%2f05%2fget-capture-edit-screen-with-snagit.html" border="0" alt="kick it on DotNetKicks.com" /&gt;&lt;/a&gt;
</description>
      <link>http://www.dotnetkicks.com/other/Get_capture_edit_your_screen_with_SnagIt</link>
      <guid isPermaLink="true">http://www.dotnetkicks.com/other/Get_capture_edit_your_screen_with_SnagIt</guid>
      <pubDate>Sat, 17 May 2008 14:18:06 GMT</pubDate>
    </item>
    <item>
      <title>Integer to Byte using Bitwise Operators</title>
      <description>A sample that makes use of F#'s bitwise operators to encode (signed) 32-bit integers into 1, 2, or 5 bytes, represented by returning a list of integers. Integers in the range 0 to 127 return a list of length 1. A detailed review of the bitwise operations is provided so that you can better realize what's going on during the encoding process. &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;a href="http://www.dotnetkicks.com/kick/?url=http%3a%2f%2flenielmacaferi.blogspot.com%2f2008%2f05%2finteger-to-byte-using-bitwise-operators.html"&gt;&lt;img src="http://www.dotnetkicks.com/Services/Images/KickItImageGenerator.ashx?url=http%3a%2f%2flenielmacaferi.blogspot.com%2f2008%2f05%2finteger-to-byte-using-bitwise-operators.html" border="0" alt="kick it on DotNetKicks.com" /&gt;&lt;/a&gt;
</description>
      <link>http://www.dotnetkicks.com/other/Integer_to_Byte_using_Bitwise_Operators</link>
      <guid isPermaLink="true">http://www.dotnetkicks.com/other/Integer_to_Byte_using_Bitwise_Operators</guid>
      <pubDate>Mon, 12 May 2008 21:43:46 GMT</pubDate>
    </item>
    <item>
      <title>Visual Studio 2008 and .NET Framework 3.5 Service Pack 1 Beta</title>
      <description>public beta of upcoming .NET 3.5 SP1 and VS 2008 SP1 releases is published &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;a href="http://www.dotnetkicks.com/kick/?url=http%3a%2f%2fweblogs.asp.net%2fscottgu%2farchive%2f2008%2f05%2f12%2fvisual-studio-2008-and-net-framework-3-5-service-pack-1-beta.aspx"&gt;&lt;img src="http://www.dotnetkicks.com/Services/Images/KickItImageGenerator.ashx?url=http%3a%2f%2fweblogs.asp.net%2fscottgu%2farchive%2f2008%2f05%2f12%2fvisual-studio-2008-and-net-framework-3-5-service-pack-1-beta.aspx" border="0" alt="kick it on DotNetKicks.com" /&gt;&lt;/a&gt;
</description>
      <link>http://www.dotnetkicks.com/visualstudio/Visual_Studio_2008_and_NET_Framework_3_5_Service_Pack_1_Beta</link>
      <guid isPermaLink="true">http://www.dotnetkicks.com/visualstudio/Visual_Studio_2008_and_NET_Framework_3_5_Service_Pack_1_Beta</guid>
      <pubDate>Mon, 12 May 2008 17:46:04 GMT</pubDate>
    </item>
    <item>
      <title>A tribute to Mozilla Firefox nightly builds</title>
      <description>Because I like Firefox so much I decided to write something about the nightly builds of its next version 3.0. See for yourself some of the great features that this web browser has. It is completely customizable with support to lots of upcoming technologies. Using the nightly builds you'll have the chance of experimenting such upcoming innovations. &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;a href="http://www.dotnetkicks.com/kick/?url=http%3a%2f%2flenielmacaferi.blogspot.com%2f2008%2f05%2ftribute-to-firefox-nightly-builds.html"&gt;&lt;img src="http://www.dotnetkicks.com/Services/Images/KickItImageGenerator.ashx?url=http%3a%2f%2flenielmacaferi.blogspot.com%2f2008%2f05%2ftribute-to-firefox-nightly-builds.html" border="0" alt="kick it on DotNetKicks.com" /&gt;&lt;/a&gt;
</description>
      <link>http://www.dotnetkicks.com/other/A_tribute_to_Mozilla_Firefox_nightly_builds</link>
      <guid isPermaLink="true">http://www.dotnetkicks.com/other/A_tribute_to_Mozilla_Firefox_nightly_builds</guid>
      <pubDate>Thu, 08 May 2008 09:35:03 GMT</pubDate>
    </item>
    <item>
      <title>Introduction to the FSharp programming language</title>
      <description> A brief introduction to the F# programming language that will be the next one to integrate Microsoft Visual Studio. From the point of view of a C# programmer there's a lot you must learn to master the new concepts related to this powerful functional programming language. See where to download the F# compiler bits and start programming today. &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;a href="http://www.dotnetkicks.com/kick/?url=http%3a%2f%2flenielmacaferi.blogspot.com%2f2008%2f05%2fintro-to-fsharp-programming-language.html"&gt;&lt;img src="http://www.dotnetkicks.com/Services/Images/KickItImageGenerator.ashx?url=http%3a%2f%2flenielmacaferi.blogspot.com%2f2008%2f05%2fintro-to-fsharp-programming-language.html" border="0" alt="kick it on DotNetKicks.com" /&gt;&lt;/a&gt;
</description>
      <link>http://www.dotnetkicks.com/other/Introduction_to_the_FSharp_programming_language</link>
      <guid isPermaLink="true">http://www.dotnetkicks.com/other/Introduction_to_the_FSharp_programming_language</guid>
      <pubDate>Wed, 07 May 2008 04:06:01 GMT</pubDate>
    </item>
    <item>
      <title>Yet Another Project Euler Series (YAPES)</title>
      <description>For the past several months, I've been using F# to solve at least two Project Euler problems each week. I find this is a great way to sharpen my math skills and my F# skills simultaneously. If you're looking for a way to flex your programming muscles, you really should check out Project Euler. &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;a href="http://www.dotnetkicks.com/kick/?url=http%3a%2f%2fdiditwith.net%2f2008%2f04%2f24%2fYetAnotherProjectEulerSeriesYAPES.aspx"&gt;&lt;img src="http://www.dotnetkicks.com/Services/Images/KickItImageGenerator.ashx?url=http%3a%2f%2fdiditwith.net%2f2008%2f04%2f24%2fYetAnotherProjectEulerSeriesYAPES.aspx" border="0" alt="kick it on DotNetKicks.com" /&gt;&lt;/a&gt;
</description>
      <link>http://www.dotnetkicks.com/other/Yet_Another_Project_Euler_Series_YAPES</link>
      <guid isPermaLink="true">http://www.dotnetkicks.com/other/Yet_Another_Project_Euler_Series_YAPES</guid>
      <pubDate>Tue, 06 May 2008 18:31:02 GMT</pubDate>
    </item>
    <item>
      <title>Thread Safe Circular Queue Implementation in CSharp</title>
      <description>While completing a screen for a Software Development Engineer in Test (SDTE) position at Microsoft I had to implement a thread safe circular queue. The question asked: Implement a circular queue of integers of user-specified size using a simple array. Provide routines to initialize(), enqueue() and dequeue() the queue. Make it thread safe. &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;a href="http://www.dotnetkicks.com/kick/?url=http%3a%2f%2flenielmacaferi.blogspot.com%2f2008%2f04%2fthread-safe-circular-queue-in-csharp.html"&gt;&lt;img src="http://www.dotnetkicks.com/Services/Images/KickItImageGenerator.ashx?url=http%3a%2f%2flenielmacaferi.blogspot.com%2f2008%2f04%2fthread-safe-circular-queue-in-csharp.html" border="0" alt="kick it on DotNetKicks.com" /&gt;&lt;/a&gt;
</description>
      <link>http://www.dotnetkicks.com/csharp/Thread_Safe_Circular_Queue_Implementation_in_CSharp</link>
      <guid isPermaLink="true">http://www.dotnetkicks.com/csharp/Thread_Safe_Circular_Queue_Implementation_in_CSharp</guid>
      <pubDate>Wed, 30 Apr 2008 02:11:02 GMT</pubDate>
    </item>
    <item>
      <title>PivotTable and PivotChart with Microsoft Excel</title>
      <description>In this post I use a sample spreadsheet that stores the grades of a college student to show how to create a pivot table and a pivot chart using Microsoft Excel 2007. A pivot table is extremely helpful when we want to summarize data through different forms. A PivotChart can be used to display a PivotTable's summarized data. &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;a href="http://www.dotnetkicks.com/kick/?url=http%3a%2f%2flenielmacaferi.blogspot.com%2f2008%2f04%2fpivottable-and-pivotchart-with.html"&gt;&lt;img src="http://www.dotnetkicks.com/Services/Images/KickItImageGenerator.ashx?url=http%3a%2f%2flenielmacaferi.blogspot.com%2f2008%2f04%2fpivottable-and-pivotchart-with.html" border="0" alt="kick it on DotNetKicks.com" /&gt;&lt;/a&gt;
</description>
      <link>http://www.dotnetkicks.com/other/PivotTable_and_PivotChart_with_Microsoft_Excel</link>
      <guid isPermaLink="true">http://www.dotnetkicks.com/other/PivotTable_and_PivotChart_with_Microsoft_Excel</guid>
      <pubDate>Sun, 13 Apr 2008 06:04:33 GMT</pubDate>
    </item>
    <item>
      <title>Breadth and depth first search implementation in C++</title>
      <description>When I had to hand in the work for the artificial intelligence discipline, the teacher wanted the code in C++ and I had already started developing the code in C#. The result was two versions of the same functions. The code presented uses an adjacency matrix to represent the links between the cities that are part of the Romania map. Read to the end. &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;a href="http://www.dotnetkicks.com/kick/?url=http%3a%2f%2flenielmacaferi.blogspot.com%2f2008%2f03%2fbreadth-and-depth-first-search-part-3.html"&gt;&lt;img src="http://www.dotnetkicks.com/Services/Images/KickItImageGenerator.ashx?url=http%3a%2f%2flenielmacaferi.blogspot.com%2f2008%2f03%2fbreadth-and-depth-first-search-part-3.html" border="0" alt="kick it on DotNetKicks.com" /&gt;&lt;/a&gt;
</description>
      <link>http://www.dotnetkicks.com/cplusplus/Breadth_and_depth_first_search_implementation_in_C</link>
      <guid isPermaLink="true">http://www.dotnetkicks.com/cplusplus/Breadth_and_depth_first_search_implementation_in_C</guid>
      <pubDate>Sun, 23 Mar 2008 00:53:45 GMT</pubDate>
    </item>
    <item>
      <title>Understanding the Technical Book Market</title>
      <description>Mike Hendrickson from O'Reilly has published a survey of the technical book market. As when viewing the TIOBE site, I think it is wrong to extrapolate any broad conclusions about the development languages market from the data you see here. For instance, lots of developers are still writing batch files, it just so happens that the book-market for that syntax is small. Changes in the C/C++ market are slow, which means that developers stick with tried and true books for those very popular languages rather than rushing out to buy new texts. Nevertheless, it is interesting to at least view this data, especially if you happen to be interested in technical books or trends in the broader developer landscape. &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;a href="http://www.dotnetkicks.com/kick/?url=http%3a%2f%2fblogs.msdn.com%2fcharlie%2farchive%2f2008%2f03%2f13%2funderstanding-the-technical-book-market.aspx"&gt;&lt;img src="http://www.dotnetkicks.com/Services/Images/KickItImageGenerator.ashx?url=http%3a%2f%2fblogs.msdn.com%2fcharlie%2farchive%2f2008%2f03%2f13%2funderstanding-the-technical-book-market.aspx" border="0" alt="kick it on DotNetKicks.com" /&gt;&lt;/a&gt;
</description>
      <link>http://www.dotnetkicks.com/csharp/Understanding_the_Technical_Book_Market</link>
      <guid isPermaLink="true">http://www.dotnetkicks.com/csharp/Understanding_the_Technical_Book_Market</guid>
      <pubDate>Thu, 13 Mar 2008 23:38:25 GMT</pubDate>
    </item>
    <item>
      <title>Future Focus II: Call Hierarchy</title>
      <description>The success of the first Future Focus post has made it easy for us to continue sharing our plans for the future of the C# language. Last month we looked at a C# language feature called Dynamic Lookup. This month we switch our focus to the Visual Studio IDE as we investigate a new feature named Call Hierarchy. This feature will be implemented the same way for both C# and VB developers. We will therefore ask for comments from both communities. &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;a href="http://www.dotnetkicks.com/kick/?url=http%3a%2f%2fblogs.msdn.com%2fcharlie%2farchive%2f2008%2f03%2f05%2ffuture-focus-ii-call-hierarchy.aspx"&gt;&lt;img src="http://www.dotnetkicks.com/Services/Images/KickItImageGenerator.ashx?url=http%3a%2f%2fblogs.msdn.com%2fcharlie%2farchive%2f2008%2f03%2f05%2ffuture-focus-ii-call-hierarchy.aspx" border="0" alt="kick it on DotNetKicks.com" /&gt;&lt;/a&gt;
</description>
      <link>http://www.dotnetkicks.com/csharp/Future_Focus_II_Call_Hierarchy</link>
      <guid isPermaLink="true">http://www.dotnetkicks.com/csharp/Future_Focus_II_Call_Hierarchy</guid>
      <pubDate>Fri, 07 Mar 2008 02:47:05 GMT</pubDate>
    </item>
    <item>
      <title>Robot arm with OpenGL in CSharp</title>
      <description>A computer graphics article about the virtual implementation of a robot arm with the help of OpenGL and C#. The robot arm is operated with the keyboard and mouse support. It's an interesting topic since the importance of projects related to the field of computer graphics in simulations has been growing a lot during the last years. &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;a href="http://www.dotnetkicks.com/kick/?url=http%3a%2f%2flenielmacaferi.blogspot.com%2f2008%2f02%2frobot-arm-with-opengl-in-csharp.html"&gt;&lt;img src="http://www.dotnetkicks.com/Services/Images/KickItImageGenerator.ashx?url=http%3a%2f%2flenielmacaferi.blogspot.com%2f2008%2f02%2frobot-arm-with-opengl-in-csharp.html" border="0" alt="kick it on DotNetKicks.com" /&gt;&lt;/a&gt;
</description>
      <link>http://www.dotnetkicks.com/csharp/Robot_arm_with_OpenGL_in_CSharp</link>
      <guid isPermaLink="true">http://www.dotnetkicks.com/csharp/Robot_arm_with_OpenGL_in_CSharp</guid>
      <pubDate>Sun, 10 Feb 2008 02:00:22 GMT</pubDate>
    </item>
    <item>
      <title>LINQ - Language Integrated Query</title>
      <description>The LINQ Project is a codename for a set of extensions to the .NET Framework that encompass language-integrated query, set, and transform operations. As a result of my graduation project in the computer engineering course I ended up with a concise document describing the idea behind LINQ. &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;a href="http://www.dotnetkicks.com/kick/?url=http%3a%2f%2flenielmacaferi.blogspot.com%2f2008%2f01%2flinq-language-integrated-query.html"&gt;&lt;img src="http://www.dotnetkicks.com/Services/Images/KickItImageGenerator.ashx?url=http%3a%2f%2flenielmacaferi.blogspot.com%2f2008%2f01%2flinq-language-integrated-query.html" border="0" alt="kick it on DotNetKicks.com" /&gt;&lt;/a&gt;
</description>
      <link>http://www.dotnetkicks.com/linq/LINQ_Language_Integrated_Query</link>
      <guid isPermaLink="true">http://www.dotnetkicks.com/linq/LINQ_Language_Integrated_Query</guid>
      <pubDate>Fri, 08 Feb 2008 14:27:58 GMT</pubDate>
    </item>
    <item>
      <title>LINQ Farm Seed: Aggregate Operator Part II</title>
      <description>LINQ Farm Seeds are short posts designed to be read in a few minutes. In the previous seed we used the first overload of the C# 3.0 LINQ Aggregate operator to sum a list of numbers. In this post we'll work with a list of words.  &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;a href="http://www.dotnetkicks.com/kick/?url=http%3a%2f%2fblogs.msdn.com%2fcharlie%2farchive%2f2008%2f02%2f06%2flinq-farm-seed-02-aggregate-operator-part-ii.aspx"&gt;&lt;img src="http://www.dotnetkicks.com/Services/Images/KickItImageGenerator.ashx?url=http%3a%2f%2fblogs.msdn.com%2fcharlie%2farchive%2f2008%2f02%2f06%2flinq-farm-seed-02-aggregate-operator-part-ii.aspx" border="0" alt="kick it on DotNetKicks.com" /&gt;&lt;/a&gt;
</description>
      <link>http://www.dotnetkicks.com/linq/LINQ_Farm_Seed_Aggregate_Operator_Part_II</link>
      <guid isPermaLink="true">http://www.dotnetkicks.com/linq/LINQ_Farm_Seed_Aggregate_Operator_Part_II</guid>
      <pubDate>Wed, 06 Feb 2008 21:09:56 GMT</pubDate>
    </item>
    <item>
      <title>LINQ Farm Seed 0: Operators in LINQ to Objects</title>
      <description>LINQ Farm Seeds are short posts, designed to be read in a few minutes. This post covers enumerating the operators used in LINQ to Objects. The source code for this project is available in the LINQ Farm on Code Gallery. &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;a href="http://www.dotnetkicks.com/kick/?url=http%3a%2f%2fblogs.msdn.com%2fcharlie%2farchive%2f2008%2f02%2f04%2flinq-farm-seed-0-show-me-the-operators.aspx"&gt;&lt;img src="http://www.dotnetkicks.com/Services/Images/KickItImageGenerator.ashx?url=http%3a%2f%2fblogs.msdn.com%2fcharlie%2farchive%2f2008%2f02%2f04%2flinq-farm-seed-0-show-me-the-operators.aspx" border="0" alt="kick it on DotNetKicks.com" /&gt;&lt;/a&gt;
</description>
      <link>http://www.dotnetkicks.com/linq/LINQ_Farm_Seed_0_Operators_in_LINQ_to_Objects</link>
      <guid isPermaLink="true">http://www.dotnetkicks.com/linq/LINQ_Farm_Seed_0_Operators_in_LINQ_to_Objects</guid>
      <pubDate>Tue, 05 Feb 2008 06:54:08 GMT</pubDate>
    </item>
    <item>
      <title>A Higher Calling (revisited)</title>
      <description>Today, I want to take a brief detour from our excursions into C# 2.0 and examine the C# 3.0 example from my recent article on higher-order functions... &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;a href="http://www.dotnetkicks.com/kick/?url=http%3a%2f%2fdiditwith.net%2f2007%2f06%2f27%2fAHigherCallingRevisited.aspx"&gt;&lt;img src="http://www.dotnetkicks.com/Services/Images/KickItImageGenerator.ashx?url=http%3a%2f%2fdiditwith.net%2f2007%2f06%2f27%2fAHigherCallingRevisited.aspx" border="0" alt="kick it on DotNetKicks.com" /&gt;&lt;/a&gt;
</description>
      <link>http://www.dotnetkicks.com/csharp/A_Higher_Calling_revisited</link>
      <guid isPermaLink="true">http://www.dotnetkicks.com/csharp/A_Higher_Calling_revisited</guid>
      <pubDate>Tue, 29 Jan 2008 04:07:10 GMT</pubDate>
    </item>
    <item>
      <title>Virtual Office</title>
      <description>A virtual office is an alternative for those that are starting up a new company because it permits the company's owner to focus more on the services being offered than all other peculiarities inherent to the establishment of a physical place and further necessities such: furniture, equipments, client reception, etc. &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;a href="http://www.dotnetkicks.com/kick/?url=http%3a%2f%2flenielmacaferi.blogspot.com%2f2007%2f12%2fvirtual-office.html"&gt;&lt;img src="http://www.dotnetkicks.com/Services/Images/KickItImageGenerator.ashx?url=http%3a%2f%2flenielmacaferi.blogspot.com%2f2007%2f12%2fvirtual-office.html" border="0" alt="kick it on DotNetKicks.com" /&gt;&lt;/a&gt;
</description>
      <link>http://www.dotnetkicks.com/other/Virtual_Office</link>
      <guid isPermaLink="true">http://www.dotnetkicks.com/other/Virtual_Office</guid>
      <pubDate>Sat, 26 Jan 2008 01:05:08 GMT</pubDate>
    </item>
    <item>
      <title>Top-Down approach in distributed databases</title>
      <description>A distributed database is formed by a collection of multiple databases logically interrelated in a computer network. The top-down approach when used in distributed databases correlates a series of stages for the construction of a distributed database project beginning from the ground and is employed in homogeneous systems. &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;a href="http://www.dotnetkicks.com/kick/?url=http%3a%2f%2flenielmacaferi.blogspot.com%2f2007%2f12%2ftop-down-approach-in-distributed.html"&gt;&lt;img src="http://www.dotnetkicks.com/Services/Images/KickItImageGenerator.ashx?url=http%3a%2f%2flenielmacaferi.blogspot.com%2f2007%2f12%2ftop-down-approach-in-distributed.html" border="0" alt="kick it on DotNetKicks.com" /&gt;&lt;/a&gt;
</description>
      <link>http://www.dotnetkicks.com/database/Top_Down_approach_in_distributed_databases</link>
      <guid isPermaLink="true">http://www.dotnetkicks.com/database/Top_Down_approach_in_distributed_databases</guid>
      <pubDate>Sat, 26 Jan 2008 00:45:17 GMT</pubDate>
    </item>
    <item>
      <title>Client server architecture</title>
      <description>The client server architecture is a computer architecture which separates a client computer from a server computer and is most implemented in a computer network such as the Internet. Practically all the services that are present in the Internet are based on this architecture. &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;a href="http://www.dotnetkicks.com/kick/?url=http%3a%2f%2flenielmacaferi.blogspot.com%2f2008%2f01%2fclient-server-architecture.html"&gt;&lt;img src="http://www.dotnetkicks.com/Services/Images/KickItImageGenerator.ashx?url=http%3a%2f%2flenielmacaferi.blogspot.com%2f2008%2f01%2fclient-server-architecture.html" border="0" alt="kick it on DotNetKicks.com" /&gt;&lt;/a&gt;
</description>
      <link>http://www.dotnetkicks.com/architecture/Client_server_architecture</link>
      <guid isPermaLink="true">http://www.dotnetkicks.com/architecture/Client_server_architecture</guid>
      <pubDate>Sat, 26 Jan 2008 00:18:22 GMT</pubDate>
    </item>
    <item>
      <title>Breadth and depth first search implementation in CSharp - part 2</title>
      <description>More details and explanations about how to use the breadth and depth search methods. We'll execute a test case using the Romania map, print the traveled paths in the screen, calculate the shortest path possible between two cities using Dijkstra's algorithm and print such a path in the screen. The complete code is available at the end of the post! &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;a href="http://www.dotnetkicks.com/kick/?url=http%3a%2f%2flenielmacaferi.blogspot.com%2f2008%2f01%2fbreadth-and-depth-first-search-part-2.html"&gt;&lt;img src="http://www.dotnetkicks.com/Services/Images/KickItImageGenerator.ashx?url=http%3a%2f%2flenielmacaferi.blogspot.com%2f2008%2f01%2fbreadth-and-depth-first-search-part-2.html" border="0" alt="kick it on DotNetKicks.com" /&gt;&lt;/a&gt;
</description>
      <link>http://www.dotnetkicks.com/csharp/Breadth_and_depth_first_search_implementation_in_CSharp_part_2</link>
      <guid isPermaLink="true">http://www.dotnetkicks.com/csharp/Breadth_and_depth_first_search_implementation_in_CSharp_part_2</guid>
      <pubDate>Sat, 26 Jan 2008 00:15:48 GMT</pubDate>
    </item>
    <item>
      <title>Breadth and depth first search implementation in CSharp - part 1</title>
      <description>The idea behind search algorithms is to simulate the exploration of a space of states or search space through the generation of successor states already explored. The search space can be explored in different orders for instance level by level (Breadth-first search) or reaching a leaf node first and backtracking (Depth-first search). &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;a href="http://www.dotnetkicks.com/kick/?url=http%3a%2f%2flenielmacaferi.blogspot.com%2f2008%2f01%2fbreadth-and-depth-first-search.html"&gt;&lt;img src="http://www.dotnetkicks.com/Services/Images/KickItImageGenerator.ashx?url=http%3a%2f%2flenielmacaferi.blogspot.com%2f2008%2f01%2fbreadth-and-depth-first-search.html" border="0" alt="kick it on DotNetKicks.com" /&gt;&lt;/a&gt;
</description>
      <link>http://www.dotnetkicks.com/csharp/Breadth_and_depth_first_search_implementation_in_CSharp_part_1</link>
      <guid isPermaLink="true">http://www.dotnetkicks.com/csharp/Breadth_and_depth_first_search_implementation_in_CSharp_part_1</guid>
      <pubDate>Sat, 26 Jan 2008 00:13:24 GMT</pubDate>
    </item>
    <item>
      <title>Critical Path Method implementation in C#</title>
      <description>The Critical Path Method or just CPM is a mathematically based algorithm for scheduling a set of project activities. The essential technique for using CPM is to construct a model of the project that includes a list of all activities required to complete the project, the time (duration) of each activity and the dependencies between the activities. &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;a href="http://www.dotnetkicks.com/kick/?url=http%3a%2f%2flenielmacaferi.blogspot.com%2f2007%2f12%2fcritical-path-method.html"&gt;&lt;img src="http://www.dotnetkicks.com/Services/Images/KickItImageGenerator.ashx?url=http%3a%2f%2flenielmacaferi.blogspot.com%2f2007%2f12%2fcritical-path-method.html" border="0" alt="kick it on DotNetKicks.com" /&gt;&lt;/a&gt;
</description>
      <link>http://www.dotnetkicks.com/csharp/Critical_Path_Method_implementation_in_C</link>
      <guid isPermaLink="true">http://www.dotnetkicks.com/csharp/Critical_Path_Method_implementation_in_C</guid>
      <pubDate>Fri, 25 Jan 2008 23:29:12 GMT</pubDate>
    </item>
    <item>
      <title>A Higher Calling</title>
      <description>Functional Programming Style in C# &lt;br /&gt;&lt;br /&gt;&lt;br /&gt;&lt;a href="http://www.dotnetkicks.com/kick/?url=http%3a%2f%2fdiditwith.net%2f2007%2f06%2f21%2fAHigherCalling.aspx"&gt;&lt;img src="http://www.dotnetkicks.com/Services/Images/KickItImageGenerator.ashx?url=http%3a%2f%2fdiditwith.net%2f2007%2f06%2f21%2fAHigherCalling.aspx" border="0" alt="kick it on DotNetKicks.com" /&gt;&lt;/a&gt;
</description>
      <link>http://www.dotnetkicks.com/csharp/A_Higher_Calling_1</link>
      <guid isPermaLink="true">http://www.dotnetkicks.com/csharp/A_Higher_Calling_1</guid>
      <pubDate>Thu, 06 Dec 2007 14:38:11 GMT</pubDate>
    </item>
  </channel>
</rss>