Open Source BSD Algorithms

Structorizer is a little tool which you can use to create Nassi-Schneiderman Diagrams (NSD). Stuctorizer is written in Java and free for any use. The code has been moved to Github: https://github.com/fesch/Structorizer.Desktop

TSPSG is intended to generate and solve Travelling Salesman Problem (TSP) tasks. It uses Branch and Bound method for solving. An input is a number of cities and a matrix of city-to-city travel prices. The matrix can be populated with random values in a given range (useful for generating tasks). The result is an optimal route, its price, step-by-step matrices of solving and solving graph. The task can be saved in internal binary format and opened later. The result can be printed or saved as PDF, HTML, or ODF. TSPSG may be useful for teachers to generate test tasks or just for regular users to solve TSPs. Also, it may be used as an example of using Branch and Bound method to solve a particular task.

La suite logicielle Monia est destinée à l'apprentissage de l'algorithmique en français. Elle permet de fabriquer un exécutable à partir d'un organigramme, en passant par un programme procédural écrit en pseudo-langage.

Sudoku Maker is a generator for Sudoku number puzzles. It uses a genetic algorithm internally, so it can serve as an introduction to genetic algorithms. The generated Sudokus are usually very hard to solve -- good for getting rid of a Sudoku addiction.

Java Combinatorial Optimization Platform is used to solve combinatorial problems using common interface, providing means to easily add new algorithms and problems and to benchmark them.

Arageli is a C++ library for computations in arithmetic, algebra, geometry, linear and integer linear programming. Arageli provides routines and classes that support precise, i.e. symbolic or algebraic, computations.

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. That library is intended to be used in simulated environment: it does not intend to be used in real world production systems.

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

Please, do not hesitate to contact Dr. Haitham Sobhy if you need help. Gemi, an automated, fast, and easy-to-use bioinformatics tool with a user-friendly interface to design primers and probes for polymerase chain reaction (PCR). Gemi accepts multiple aligned and long DNA and RNA sequences with degenerate nucleotide (non-A/C/G/T bases). Gemi can be used for quantitative, real-time and conventional PCR (qPCR, rt-PCR, etc.), and Sanger sequencing. Gemi can parse large dataset of sequences efficiently. Article: Gemi: PCR primers prediction from multiple alignments Comparative and functional genomics 2012;2012:783138 DOI: https://doi.org/10.1155/2012/783138 PMID: https://www.ncbi.nlm.nih.gov/pubmed/23316117 PMCID: https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3535827/

An online edition of the book "The Practice of Parallel Programming" and examples from it. The examples include a parallel programming framework of production quality, that has been used in another project, Triceps.

EasyCSP is an open-source Java library for Constraint Satisfaction Programming. EasyCSP offers search algorithms for both CSPs and CSOPs. EasyCSP supports CSPs to be formalized using objects or int expressions. EasyCSP on GitHub: http://github.com/cordisvictor/easycsp-lib

S-Match is a semantic matching framework. S-Match takes any two tree like structures (such as database schemas, classifications, lightweight ontologies) and returns a set of correspondences between those tree nodes which semantically correspond to one another. S-Match contains implementations of the semantic matching, minimal semantic matching and structure preserving semantic matching algorithms. S-Match applies as a solution in many fields, including: information integration, ontology evolution and alignment, peer-to-peer information sharing, digital libraries integration, web service composition, agent communication, and query answering on the web. S-Match is extendable to host new algorithms.

An enhanced Simulator based on Agent Grid Repast.It has some bugs cleared from Agent Grid Repast and has enhanced features on Group Selection Policy.

A fast way to rate the reading challenging level of book or text. Unlike well known reading metrics such as Fog, Kincaid, SMOG, ARI, Flesch, and Coleman-Liau readability this metric takes into account far more factors and is standarized against a corpus

Este proyecto constituye una adaptacion y mejora del codigo ANFIS de dominio público de Roger Jang. / This project is an adaptation and improvement of the original public domain ANFIS code of Roger Jang.

High-performance computing code and libraries used in the High Performance Computing subject in Telecommunications Engineering at the University of Granada (http://geneura.ugr.es/~jmerelo/asignaturas/AAP)

Seeds is a project which implements Data structure and Algorithms! We aim for speed, flexible and the easy to use!

The toolkit glpk supports methods for mixed integer linear programming (MILP). These methods solve Capital Budgeting Problems (CBP). Unfortunately, glpk does not support any multithreading and there is no feature to distribute problems via network connections. Today, this is a pitiable sight, because modern computer systems are coupled by networks and support multi threading. We create a distributed system with Apache thrift and the C-API of glpk. Now, it is possible to use as many cores in a network as you want. With a focus on the MILP methods we implement a load balancing and speed up the solving process in a multiplicative way. Sometimes we have super-linear speedup with a small set of hardware. With a splitting of problems, parallel computing and distributing the actual best solution to all running processes we solve CBP much faster than a sequential processing can do.

BigAl is a free open source and platform independent software for calculating really BIG numbers. It supports not only standard arithmetic, but also exact period determination, predefined factorials, fibonacci with seeds, factorization, nth root, etc

Blubber system is an Eclipse RCP application for distributed systems modeling. Designed for university researches and inlcudes: task graph editor; graph transformation tools; graph modelling on distributed system; real-time modelling on GerdaFramework.

A set of useful non-visual C#/.NET classes

Continuous wavelet transform library

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.

Gamoliyas is an open source John Conway's Game of Life game totally written in DHTML (JavaScript, CSS and HTML). Uses mouse and keyboard. Very configurable. This cross-platform and cross-browser game was tested under BeOS, Linux, *BSD, Windows and other

Hipo is a hypothetical computer to facilitate the learning of machine language. The student can use hipo to develop simple programs and understand the internal logic of a computer. There is a plan to implement Donald Knuth's MMIX machine language, also.