Open Source Algorithms - Page 8

Find case inconsistencies in the source tree. May be useful for porting applications in any programming language from case-insensitive (like Windows) to case-sensitive (like Linux) runtime environment.

The Catalsyt Framework is a refinement on the MVC framework. It provides greater focus on user business workflow rather than application workflow. It's goal is to enable business analysis and developers to work closer.

ChIPOTle 2.0 is a user friendly tool for performing peak detection in ChIP-chip signal. The tool also has functions for probe sorting, signal normalization, replication merging, and multiple correction testing in a windows interface or *nix command line.

Hasher is a .NET class library to help programmers implement standard hashing and checksum algorithms into their own software. Written entirely in C#, Hasher providers a uniform interface to easily use any of the algorithms contained within this library

A C++ library for clipping polygons.

CoPP is an object-oriented framework for developing algorithms for robot path planning. One of of the design goals is to make it easy to make comparisons between various path planning algorithms.

A library of data structures with a unified API, written in portable C. Lists (uni- and bidirectional), a vector, a hash, a balanced tree (RB or AVL), a heap and tuples. Memory management, clone support, error handling.

Combean is a Java framework for mathematical structures and optimization algorithms. Through a set of Java interfaces and JavaBeans-based config, Combean glues optimization codes together - leading to more interoperable, adaptable and flexible solutions.

It consists of a library of Java classes that gives us support the programming of applications. Boring, repetitive tasks will be included in CommunityUtil. So this is the aim: to provide fast that encapsulates all classes complicated tasks.

CILib is a framework for developing Computational Intelligence software in swarm intelligence, evolutionary computing, neural networks, artificial immune systems, fuzzy logic and robotics.

CoRoPa stands for Computational Rough Paths. The aim of CoRoPa is to provide a software framework for various ideas related to Rough Path Theory, including rough differential equations and the digital description of serial data streams.

Conrad is both a high performance Conditional Random Field engine which can be applied to a variety of machine learning problems and a specific set of models for gene prediction using semi-Markov CRFs.

Esta é a documentação de um projeto de conclusão de curso feito na conclusão do curso de Engenharia de Computação-UNIVALI.É um conjunto de arquivos C e Matlab contendo a implementação da Lógica Fuzzy e simulações em sistema de enegia.

I was curious how much better the Algorithms, pointed out by BitTwiddling Hacks, perform than a simple Lookup Table approach... Now I think, perhaps my little investigation is interesting for others too... PS: the parallel counting Algo is about 35% faster on average on my computers than a simple LUT based solution. Also this shows nicely how different a human brain compatible solution is to a binary machine optimal solution :-) In the meantime I added other Algorithms beside countbisset (hamming weight): ceil(log2()) + floor(log2()), bitreverse, ... I also recommand to try the code with different compilers and / or plattforms. PS: see result.txt in Code, to see various runs with different compilers and compiler switches

Crazy Turtle puzzle game solver utility. Other names: CRAZY TURTLE / LE JEU FOU DE LA TORTUE / NAUGHTY TURTLES / ŠAŠAVE KORNJAČE / NAGAJIVE ŽELVICE / SASAVE KORNJACE

A C++ library implementing an efficient trie data structure called Double-Array.

DBI++ is a C++ port of the famous Perl DBI module. Currently it just supports MySQL, but the goal is, to extend it to a driver-independent interface. License is LGPL, so it can be used in closed-source-software, too.

A light-weight group communication system/library of distributed algorithms implementations for agreement problems (e.g., Consensus, Unreliable Leader Election and Atomic Broadcast).

This is an implementation of Donald Knuth's Algorithm X ("dancing links"). This is primarily a sudoku generator and solver, though it can be used to solve other exact cover problems.

Very fast and easy to use Java tool for solving and generating Sudoku puzzles. By using Donald Knuths exact cover algorithmus it can not only solve or create the usual 9x9 but also 4x4, 16x16 or even bigger Sudokus in a very efficient way.

The Data Structure & Algorithm Library (DSAL) is a library of classical data structure and algorithm.

This chess program changes its strength to give the best match against you. Eventually it learns to beat you specifically through learning alogirthms. Features included transposition tables and a elementary 3-piece endgame tablebase.

This project is an extended implementation of Knuth's "Dancing Links" algorithm and some use cases (e.g. Sudoku).

Robust Perl OO Module for Digest based Authentication leveraging DBI as a backend. This Performance oriented Hash Authentication Library is scalable from single pc to multi-database single signon www applications. Optionally uses Javascript and Cookies.

Free scripts & examples- JSP, Eclipse, SQL, PHP, ASP, Win32 Batch, Javascript, Flash/Actionscript. -=-=-=-=-=-=- NOTE: This project is closed. For new development related to integrating Beyond Compare with Eclipse, see http://beyondcvs.sourceforge.net/