The aim of Hipster is to provide an easy to use yet powerful and flexible type-safe Java library for heuristic search. Hipster relies on a flexible model with generic operators that allow you to reuse and change the behavior of the algorithms very easily. Algorithms are also implemented in an
... [More] iterative way, avoiding recursion. This has many benefits: full control over the search, access to the internals at runtime or a better and clear scale-out for large search spaces using the heap memory.
You can use Hipster to solve from simple graph search problems to more advanced state-space search problems using common AI search strategies such as Dijkstra, A*, Bellman-Ford, IDA* and more. [Less]
Trabajo practico final para la catedra de Diseño e Implementación de Estructuras de Datos de la FRSF - UTN - 2006
Implementar una aplicación que permita representar un servicio de Mapa Dinámico de Recorridos de Metrovías, utilizando estructuras de datos dinámicas.
This cross-platform multithreaded GUI C++ application was developed for two obvious reasons:
1. In research of multithreaded application behavior with shared resources provided by emulating classical Dijkstra's "Dining philosophers" with some more complex extensions and parameters in control.
2. To demonstrate how cross-platform multithreaded applications with graphical user interface can be made with Ultimate++ IDE and library.
The original application and article were written in 2007 but the English translation and first public release was made in 2009.
Articles with detailed descriptions are available in PDF format in Dowloads section. [Less]