Search Results for "source code pro" - Page 4

A capsule tree is a general purpose, self-balancing tree data structure for large, ordered, data-sets. It is designed to provide the same characteristics as B-trees and B+trees, but built from the ground up for in-memory usage. In other words, there are no provisions for “slow” I/O cases. The original motivation for this tree was a better backend for memory managers. However, the end result was a new sub-category of trees. The implementation giving here is just one implementation of...

Mouse Run is a programming game where programmers can implement a mouse and let it run in a maze to hunt of cheese. It is a battle among programmers to test who can build the most intelligent mouse, given limited information during the game. Programmers need only implement one code file, extending from an abstract class that will contain the logic of the individual mouse. The game Host will gather all the mouse implementation and let them run in the maze. It is real fun for...

parFE is fully-parallel high-performance finite element code targeted to the modeling of trabecular bones in humans. It employs scalable multigrid solvers for efficient solutions on massively parallel computers.

Sample code, algos, what you got?

FREE Download Open Source Code Simple Test of Microsoft .NET C# using MATLAB NE Builder Toolbox This is a simple demo of this powerful Matlab toolbox with some M script algo examples Download the ZIP package from http://quantlabs.net/blog/2012/11/free-download-open-source-code-simple-test-of-microsoft-net-c-using-matlab-ne-builder-toolbox-matlab-csharp/

ACADO Toolkit is a software environment and algorithm collection for automatic control and dynamic optimization. It provides a general framework for using a great variety of algorithms for direct optimal control, including model predictive control, state and parameter estimation and robust optimization. ACADO Toolkit is implemented as self-contained C++ code and comes along with user-friendly MATLAB interface. The object-oriented design allows for convenient coupling of existing optimization...

This is a small Java swing application that shows different sorting algorithms working on the same set of data. The user can modify the speed of execution and the type of data to sort and execute it step by step. The tooltip of each algorithm's box shows the source code that is executed and a little explanation got from wikipedia. This application is aided to computer science students who want to better understand how the algorithms work.

The 'cbear' framework is a set of libraries and common utilities for different programming languages and platforms.

Open Metaheuristic (oMetah) is a library aimed at the conception and the rigourous testing of metaheuristics (i.e. genetic algorithms, simulated annealing, ...). The code design is separated in components : algorithms, problems and a test report generator

jsGorithm is a Javascript algorithm execution viewer that can be used as an educative tool for introductory courses on programming and algorithmics, with programs written in a subset of C/C++/Javascript. It can be used for teaching and learning.

This is a Java-based project for complex event extraction from text and co-reference resolution. Currently the code can read BioNLP shared task format (http://2011.bionlp-st.org/) and i2b2 Natural Language Processing for Clinical Data shared task format (https://www.i2b2.org/NLP/DataSets/Main.php). Event extraction includes finding events and the parameters for an event in a text. The method is based on SVM but other ML algorithms can be adopted. The method details are explained in the...

PSF is a path-sensitive, inter-procedural program analysis framework developed on top of Soot.

Battle Code/Engine made in PHP and intended for browser games. Version 1.0-beta released after some testing. The homepage now links to the simulator available in the files.

op4j is a developer happiness tool. Its aim is to reduce the amount of similar lines of code needed to do every day tasks in our code by providing an operator chaining tool to perform easy iterations on lists, OGNL evaluation, data type conversion...

An interactive binary search tree. The user may interact with the tree by performing rotations, balancing, insertions, and deletions. For educational purposes

LDIFF is an enhanced language-independent line differencing tool built upon the Unix diff and overcomes its limitations in determining whether an artifact line has been changed or is the result of additions and removals

A fully functional red-black tree implemented in C++/CLI with an OO approach of naming and structuring which makes the code highly readable as well as easily portable to C# or Java. The package also includes a binary search tree and two traversal algorithms.

Don't hard-code data-structures for Artificial Intelligence (AI). Evolve them (and control flow) as cycles of arrays in arrays with size constraints based on other array sizes (at specific index) in terms of range, multiply, exponent, or permutation. No working code yet. Whats there now is an extension of GigaLineCompile which would become part of Human AI Net, but there are other projects to finish before I can come back to this one.

A base set of libraries. Boilerplate type code and algorithms. Currently skuttil (Java util & parsing code) and searKit (generic Java search framework).

This is a tidy lightweight library implementing a series of C++ Design Patterns, aiming to be simple, clean and portable. This library is made to help C++ programmers to develop projects with clearer and more compact source code.

LSGTL means LLX’s Static Graph Template Library which is a light-weighted header-only template library developed mainly for static graph analysis. LSGTL is expected to be used in laboratories for research purposes mostly.

NT2 is a multi-platform C++ library providing various template matrix classes that can be used with a Matlab(tm) like syntax whose performances are close to those obtained with hand written C code. NT2 comes with various numerical toolboxes.

An implementation of Bruhn et al.'s fast variational optical flow algorithm using the OpenCV image processing library. The code calculates dense flow fields with a user-specified level of precision.

Now part of Apache's Mahout machine learning project at http://mahout.apache.org/-- please see there for latest info and code and releases and support!

A Java package for pretty-printing a text by deciding where to introduce line-breaks and indentation. A Java implementation of Derek Oppen\'s pretty printing algorithm. It is _not_ a pretty printer for Java code, though it could be used to write one.