Open Source Algorithms - Page 12

ADiV is a set of components for LAMW that uses JAVA and Pascal. It stands out for the simplicity of programming, thanks to the use of Pascal and hiding the Java Android code.

A package of Rijndael, Twofish and Serpent encryption algorithms implemented in x86 assembly. Meant to learn basics of assembly, learn about the algorithms or to be used in a C program.

It is a HTML content extractor library. It is modular, so no need for using confusing regular expressions. The output is a character array, so the calling program just needs to know the file name and it gets the output in char array.

It's a simpler clone of RoboCode. It's a game which simulates tanks war. The focus is artificial intelligence AI, evolutive algorithms and neural networks. It's implemented in Java.

Herramienta para el aprendizaje de algoritmos de búsqueda en Inteligencia Artificial.

AIL is an AI library that will help you to use algorithms such as A*,DFS and BFS.

Pacote de funcionalidades em FPC/Lazarus para serem utilizadas no desenvolvimento de jogos de Xadrez.

A tool that helps develope the course of cognitive thought processes through software. This tool will look at the raw hex code of any input. It establishes pattern recognition over a mesured time incrament that in itself is at a different pace.

AMMORIA (ARAB) is an object oriented programming language uses Arabic words instead of English words, to make learning programming for Arab children easy and fast, it's planned to support Urdo and Farsi too, AMMORIA has its won IDE and Visual stuff.

The Automatic Model Optimization Reference Implementation, AMORI, is a framework that integrates the modelling and the optimization processes by providing a plug-in interface for both. A genetic algorithm and Markov simulations are currently implemented.

ANT is a lightweight implementation in C of a kind of artificial neural net called Multilayer Perceptron, which uses the backpropagation algorithm as learning method. The package includes an introductory example to start using artificial neural nets.

APCO means Adaptive Parallel COmputing framework.

All pairs shortest path implementation using iterative mapreduce paradigm. Specifically, the iterative paradigm is an implementation of Twister (www.iterativemapreduce.org), developed by Indiana University.

ARMR provides a foundation for creating an efficient in-memory database. Its unique list processing structures simplify programming logic and allow the developer to rapidly sort, group, and select data. Give your app a hypercard like capability.

Aggressive Rectangle Truncation (ART) with Location Verfication Mechanism is a localization algorithm in wireless sensor networks written in nesC.

Some data structures developed in c++ for the 'Algorithms & Data Structures' exam at the Computer Science Department of the University of Bari by Tafuni Vito & Nicola Perrini.

A branch-and-prune method to find all solutions to systems of nonlinear equations. The number of variables must equal the number of equations. The variables must have proper lower and upper bounds. The solver has an interface to the AMPL environment.

AVL Array is a sequence container (like std::vector or std::list) that allows fast insert/remove AND fast random access. Shiftable Files offers the usual file primitives plus fast insert/remove. Get the latest version via BZR in the Develop section.

This is a program for compute the dimension of the Hochschild homology k-vector spaces of a k-algebra A.

This is an Ada implementation of the Dancing Links X Algorithm as in Donald E. Knuth paper. AdaDLX is used to solve the Eight-Queens puzzle, Sudoku grids and Blocs in Box puzzle.

A Java implementation of a cubic B-spline curve smoothing function. Allows an arbitary number of points with a variable number of dimensions to have a cubic B-spline curve "fitted". Useful in finance for analysing bond or swap yield and discount curves.

Adaptive Simulated Annealing (ASA) is a C-language code that finds the best global fit of a nonlinear cost-function over a D-dimensional space. ASA has over 100 OPTIONS to provide robust tuning over many classes of nonlinear stochastic systems.

Agenda desenvolvida em Java, utilizando banco PostGreSQL. Itens: Cadastro de Contatos Cadastro de Tarefas

A rudimentary 3D computer game that utilises artificial neural networks to enable computer agents to anticipate a target's location and shoot (bullets) in the corresponding direction.

AhoCorasickDoubleArrayTrie is a Java implementation of the Aho–Corasick multi-pattern matching algorithm that is optimized using a Double-Array Trie data structure. It is designed for fast keyword scanning across large texts, where you want to search for many patterns simultaneously and efficiently. The core idea is to build an automaton from a dictionary of patterns, then stream through input text to emit matches with minimal overhead. By using a double-array trie representation, the project emphasizes performance and memory efficiency compared to simpler pointer-heavy trie structures, which can matter a lot for large dictionaries or latency-sensitive services. This makes it a strong fit for tasks like content filtering, entity/term spotting, dictionary-based annotation, or high-throughput log/text processing. In short, it’s a specialized, speed-focused library for industrial-strength multi-keyword matching in Java.