Projects

Revenue Management Optimisation Library

That project (RMOL) aims at giving developers concerned by the Revenue Management arena a library delivering a reference implementation for most of the published algorithms and methods.

ELENA Programming Language

ELENA is a new non-mainstream general-purpose, pure object-oriented language with late binding. It promotes more object-oriented program design, reusable and more standardized code. The package includes compiler, IDE, ELENA libraries and samples

gaedo

GAEDO stands for Google App Engine Data Object It's a persistence project providing dynamic query code generation: you just need to define your interfaces! For the moment Gaedo is compatible with the google appengine but is designed to be extended

Ela, functional language

Ela is a modern programming language that runs on CLR and Mono. The language is dynamically (and strongly) typed and comes with a rich and extensible type system out of box. It provides an extensive support for the functional programming paradigm including but not limited to - first class ... [More] functions, first class currying and composition, list/array comprehensions, pattern matching, polymorphic variants, thunks, etc. It also provides some imperative programming features. Ela supports both strict and non-strict evaluation but is strict by default. The current language implementation is a light-weight and efficient interpreter written fully in C#. The interpreter was designed to be embeddable and has a clear and straightforward API. [Less]

HST mixin support module

This module will provide support for easier use of mixins with Hippo HST.

scalgorithms

Scalgorithms is a collection of basic algorithms and datastructures written in Scala. Following is the list of algorithms supported so far : - Sorting : QuickSort, MergeSort - Heaps : Binomial Heaps,Fibonacci Heaps - Dynamic Programming : Longest Common Subsequence - Graphs : Search ... [More] Algorithms : Depth First (including routines for Topological Sorting and Strongly Connected Components),Breadth First, A-Star Minimum Spanning Tree Algorithms : Prim's Algorithm,Kruskal's Algorithm Shortest Path Algorithms : Single Source :Dijkstra's Algorithm, Bellman-Ford Algorithm, DAG-Shortest Path Algorithm All Pairs : Dynamic Programming based Algorithm (improved with Matrix Multiplication strategy), Floyd-Warshall Algorithm, Johnson's Algorithm Transitive Closure Algorithms :DFS based Algorithm,Floyd-Warshall Algorithm Algorithms from - Artificial Intelligence : A Modern Approach - A-Star Search - Constraint Satisfaction - Backtracking Search - Backtracking Search with Heuristics : Minimum Remaining Values(MRV) & Degree Heuristic, Least Constraining Value Heuristic, Forward Checking, Constraint Propagation - AC3 (for binary CSPs) - Game - MiniMax - Alpha-Beta Prunning [Less]

irlhmmtrainer

An implementation of a number of discriminative training methods for Hidden Markov Models. Can be used with a tweaked version of the Penn Treebank.

metadynamic-programming

Concept of dynamic programming on metaprofiles allows very effective search over instances of 2D problems, such as Polyomino Covering, Minesweeper, Cross Sum etc. Using this technique, it is possible to design gadgets (AND, NOT, crossover, splitting etc.) automatically, thus proving ... [More] NP-completeness of 2D problems in a completely new fashion. The research is conducted by Mikhail Dvorkin; help, questions and feedback are very welcome at mikhail.dvorkin@gmail.com. [Less]

hev-dp

Code database for dynamic programming for hybrid electrics

cs174final

Final project!