ScaleBase Overview – Your complete scale out partner
Watch the Video below to learn how to scale out your MySQL Database with ScaleBase. Cost-effectively...
0 replies - 48 views - 02/22/13 by Kelley Gemma in Uncategorized
You can think of planning as a graph search problem where each node in the graph represents a possible "state" of the reality. A directed edge from nodeA to...
1 replies - 5313 views - 02/12/13 by Ricky Ho in Articles
The latest problem of the Algorithms 2 class required us to write an algorithm to calculate the shortest path between two nodes on a graph and one algorithm...
0 replies - 3374 views - 02/05/13 by Mark Needham in Articles
I recently wrote a blog post describing my implementation of Kruskal’s algorithm – a greedy algorithm using to find a minimum spanning tree (MST) of a...
0 replies - 2452 views - 01/29/13 by Mark Needham in Articles
Apache Camel is a powerful, popular, open-source routing and mediation
library. This webinar aims to briefly introduce viewers to Camel and 6 of
the...
0 replies - 193 views - 01/23/13 by Brandon Nokes in Uncategorized
"Actuate BIRT’s (Business Intelligence and Reporting Tool) proven technology allows software companies to innovate, leapfrog the competition and meet...
0 replies - 128 views - 01/22/13 by Kelley Gemma in Uncategorized
Last week I wrote a couple of posts showing different implementations of Prim’s algorithm – an algorithm using to find a minimum spanning tree in a graph...
0 replies - 3321 views - 01/22/13 by Mark Needham in Articles
Introduction
We know how to add two integers using a perfectly simple and useful algorithm learned from school or even earlier. This is perhaps one of the...
0 replies - 4424 views - 01/08/13 by Stoimen Popov in Articles
Introduction
What’s the fastest way to sort the following sequence [9, 3, 0, 5, 4, 1, 2, 6, 8, 7]? Well, the question is a bit tricky since the input is...
0 replies - 3999 views - 01/02/13 by Stoimen Popov in Articles
Radix Sort
The first question we ask when we see the phrase “sorting in linear time” should be – 'what’s the catch?' Indeed there’s a catch. ...
1 replies - 5850 views - 12/26/12 by Stoimen Popov in Articles
Most of the sorting algorithms that are used are generally comparison sort. It means that each element of the collection being sorted will be compared to see...
4 replies - 5512 views - 12/18/12 by Baptiste Wicht in Articles
Introduction
We already know what about the topological sort of a directed acyclic graph. So why do we need to revisit this algorithm? First of all I never...
2 replies - 5720 views - 12/11/12 by Stoimen Popov in Articles
On Monday evening, 3rd December, 2012, I went along to the British Computer Society London in the Strand for a lecture from none other than Professor...
0 replies - 2511 views - 12/07/12 by Peter Pilgrim in Articles
Introduction
A very common problem in computer programming is finding the longest increasing (decreasing) subsequence in a sequence of numbers (usually...
1 replies - 6113 views - 12/04/12 by Stoimen Popov in Articles
Recently I’ve undertaken a personal project (computoser) that is a bit strange. I tried to write software that generates music at random. Good...
0 replies - 1445 views - 11/30/12 by Bozhidar Bozhanov in Articles
