Info World Finding the best route or the optimal answer can be harder than looking for a needle in a haystack. By Peter Wayner
'Many problems have billions, trillions, or even quadrillions of possible solutions, and finding the best one takes plenty of computing power.
'Burlap lets you define the problem as a network of nodes with vectors of features or attributes attached to it. The algorithms can search through the network using a combination of brute-force searching and statistically guided exploration. The higher level of the algorithm plans the search and deploys the best algorithms. The toolkit includes dozens of the most useful algorithms for agent-based search.
'The tool is useful for data-driven worlds where the data can be mapped into a large collection of nodes or objects. The code is written in Java and includes a large assortment of debugging and profiling tools that are useful for keeping the code moving toward the optimal goal.'
Burlap at Brown University