Open Source Algorithms - Page 9

Robot Warfare is a real-time strategy game that gives the user an opportunity to manage and program a team of battling robots that autonomously face opposing teams in a network-enabled environment.

Robotypo is a Web app which hosts battles between robots - simple Java programs. This project is the Eclipse project archive of RobotypoCreator, which is for creating robots on Robotypo: http://robotypo.appspot.com

RobGP is a genetic programming system written from the ground up in C++. It's primary goals are efficiency, ease of use, and extensibility. It's distinguishing feature is that it has a modified version of Koza's architecture altering operations.

SVM# is a svm(support vector machine) classification implemented in C#. The project contains both train and predict modules.

This project an efficient method of solving a scrabble board.

SenseRank Sys: - builds the dictionaries (multidim matrices) of words’ values; - for the set utterance in certain language builds a figure in multidimensional space (in the matrix space) of values (visual schema), which is topological view of sense

SimpleDomino is a Server for a Programming Competition from Schoolinux and Linux-dubai.com for School Students. It uses TCP/IP for Communications. (It's base on Linux but can port to Windows) You can start your own Competition or Help us to develop this P

Design and develop Recommendation and Adaptive Prediction Engines to address eCommerce opportunities. Build a portfolio of engines by creating and porting algorithms from multiple disciplines to a usable form. Try to solve NetFlix and other challenges.

This simplesudodu program is intend for studying in the sudoku solution algorithm rather than a game (If you want to make it a game, it's OK ^_^). Later I will implement the 4*4 or other kinds. Different sudoku requires different algorithm to solve.

A Java API for using suffix trees with natural language and an Eclipse/SWT-based GUI for suffix tree visualization using Graphviz.

Taseree has been renamed to Drools Planner and moved to JBoss.org, see http://www.jboss.org/drools/drools-planner

A test suite and benchmark for exact Euclidean distance transform algorithms used in Image Processing and computational geometry. It evaluates the exactness and speed of algorithms for a large number of test cases. Results can be visualized in Scilab.

Machine learning models for edge devices need to have a small footprint in terms of storage, prediction latency, and energy. One instance of where such models are desirable is resource-scarce devices and sensors in the Internet of Things (IoT) setting. Making real-time predictions locally on IoT devices without connecting to the cloud requires models that fit in a few kilobytes.These algorithms can train models for classical supervised learning problems with memory requirements that are orders of magnitude lower than other modern ML algorithms. The trained models can be loaded onto edge devices such as IoT devices/sensors, and used to make fast and accurate predictions completely offline. A tool that adapts models trained by above algorithms to be inferred by fixed point arithmetic.

The Movinator is a movie database application. It manages information about movies plus ratings assigned to movies by movie critics. Based on these ratings and user ratings, the application can also make movie recommendations.

Classic game solved with MinMax algorithm (full solution tree) and simple Heuristics. Specially for learning and teaching computer AI

Este projeto objetiva a criação de um Toolbox para utilização de algoritmos de Computação Bioinspirada. O Toobox oferece uma vasta coleção de algoritmos de ferramentas para o projeto de Algoritmos Genéticos e Redes Neurais.

A blend of neuronal networks, genetic alogorithms and peer-to-peer applied to financial forecasting.

This projects implements various optimization heuristics and meta-heuristics (such as local search, VND, GRASP, Simulated Annealing, and more still to come) finding solutions on the post enrolment course timetabling problem.

This project's goal is to implement Artificial Inteligence algorithms and make them available for any platform but especially for mobile devices. The main objective is to allow the community to develop better and more inteligent mobile games.

A library and associated tools for building and searching with Active Shape Models (ASM). It builds on the VXL computer vision libraries. Includes a GUI tool to search new images with the ASM. Depends on: VXL, Qt (Version 4), UoMqVXL

Reimplementation of the anomaly detection/one-class classification algorithm 'V-detector'.

Weka++ is a collection of machine learning and data mining algorithm implementations ported from Weka (http://www.cs.waikato.ac.nz/ml/weka/) from Java to C++, with enhancements for usability as embedded components.

KNN-WEKA provides a implementation of the K-nearest neighbour algorithm for Weka. Weka is a collection of machine learning algorithms for data mining tasks. For more information on Weka, see http://www.cs.waikato.ac.nz/ml/weka/.

This is a GUI application for learning non disjoint groups based on Weka machine learning framework. It offers a variety of learning methods, based on k-means, able to produce overlapping clusters. The application also contains an evaluation framework that calculates several external validation measures. The application offers a visualization tool to discover overlapping groups.