Search Results for "gnu linux" - Page 20

This is a library for an extensible framework for range encoding. The framework is an extensible object-based state machine where probabilities are chosen based on the current frame the machine is in.

A Pascal unit providing functions to format Brazilian Real (R$) currency.

a sandbox for trying my engine ideas

Evolutionary computation library and benchmark utility. Integer encoded genetic algorithm.

Application to automatically merge gedcom files. It provides either a user or another program the ability to merge gedcom files with as little human interaction as possible and with high quality of matching results.

In silico evolution of biochemical networks using a genetic algorithm combined with a rule-based biochemical network model.

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.

Generic engine to filter information. We wish to show that the power of expression of a filter makes it possible to appreciably reduce the size of the code necessary to extract information and that it is possible in Python.

This project aim to provide a crowd movement simulation based on primitive human behaviours and emerging behaviours for research and educational purposes. The application (front-end) is generic and can be reused.

Software Engineering project. Prototype of a navigation system simulator.

Institute of Technology, Blanchardstown Computer Science code by the class of 2007-2011 on course BN104. In this project we are open sourcing all of our project work to the public in the hopes it can be reused, built-upon, and used in education.

This STL-like C++ library contains classes for long integer numbers processing with using of assembler functions as a backend. Lazy evaluation is also used for optimization. It also contains generic implementation of classical number-theory algorithms.

Web-Service for discrete dynamic systems' model description and simulation. Firstly, recursive procedures of stochastic optimization are added. The framework for open and closed loop model description and simulation.

Procedural content generation of deterministic and complex entities, with properties and other entities inside, defined by an editable XML file, along with a framework to simulate actions, compositions, and interactions of entities.

The Rank Aggregation and Evaluation Suite is a comprehensive set of rank aggregation algorithms and performance measurement tools for use in research.

jPasswordWallet strores your passwords in security. Find, modify or create quickly a password in the database. Organize your passwords as you like with creating categories and sub categories.

Cosmos (by OpenGenus Foundation) is your personal offline collection of every algorithm and data structure one will ever encounter and use in a lifetime. This provides solutions in various languages spanning C, C++, Java, JavaScript, Swift, Python, Go and others. This work is maintained by a community of hundreds of people and is a massive collaborative effort to bring the readily available coding knowledge offline.

LZO is a compression library which is widely used around the world. The main problem with LZO is that it is absolutely not human readable. People have done crazy stuff to get LZO to run in their language. Usually it implies inline assembly or trying to execute data which actually contains machine code. This is sick. Whoever is responsible for this sorry situation ought to be ashamed. So I'm going to deobfuscate LZO and provide a ISC implementation of this algorithm in Python and C. In...

JavaGO is an Open Source Java library for the Game of GO (weiqi, baduk) analysis. Implements: base game classes, montecarlo simulations, SGF reader/writer, game variants, GTP, etc. Elegant interfaces/class design. Speed efficient w/small footprint. TDD.

RunAsApproximator es un programa java multilenguaje que implementa algoritmos numéricos. Los datos de entrada son aquellos requeridos por cada algoritmo y los de salida son resultado final y los datos intermedios necesarios para alcanzar su resolución.