Search Results for "software version control" - Page 4

JaNaG is a Java random name generator for role-games, authors, and the like. It is based on a name fragment database that creates relatively reasonably sounding names. It can run as applet, GUI appliance, command line tool, or on a server-client basis.

Java KellyCriterion Calculator

This project is open source program and finding minimum cost of daily menu.

Zero Sum Game Solver Java Library is open source java library to solve 2-player finite zero-sum games. This programs solve zero-sum games with linear programming.

Provide a testbed to play with pagerank-like algorithm on graph. You can easily add vertices, edges, save the graph for reuse, etc. For now, only Pagerank is implemented, but in the future, other algorithms will be added.

This is a Su-do-ku game solver and player. It generates a complete Sudoku.

This is a Java-based project for complex event extraction from text and co-reference resolution. Currently the code can read BioNLP shared task format (http://2011.bionlp-st.org/) and i2b2 Natural Language Processing for Clinical Data shared task format (https://www.i2b2.org/NLP/DataSets/Main.php). Event extraction includes finding events and the parameters for an event in a text. The method is based on SVM but other ML algorithms can be adopted. The method details are explained in the...

Fastest string utility is java library (JAR ) for string operation . This library is very easy to use, very fast and very efficient in string operations such as split, toUpperCase, toLowerCase, replace, delete, regular expression and others.

Framework for development of simple evolutionary algorithms / island models programs in distributed environment using MapReduce programming model based on hadoop.

Track your friends in real time on a map.. and many more features

Fractal/Scripting VSTi synthesizer, written on Java with jVSTwrapper

Korat is a tool for constraint-based generation of structurally complex test inputs for Java programs.

AlgoExplorer is a dynamic data structures viewer for Java. It allows the visualization of data structure of a Java program, allowing you to see how objects, handled by the algorithms, interact with each other and how they are related and linked. The project has been moved on: http://code.google.com/p/algoexplorer/

A self-contained, fully configurable Java "game" to simulate multi-species evolution. Design species by optionally specifying every attribute; modify any or all environmental settings; let them loose to eat, fight, procreate, die, and Evolve!

GeneThello (read jə-ˈne-ˈthe-lō), is an acronym for genetic othello, an othello (reversi) playing program which based on Genetic Algorithm (GA). In principle GeneThello consist of an othello program and a genetic algorithm system.

JavaFrameApplet is a generic base in Java for Applet in JFrame games!

PSF is a path-sensitive, inter-procedural program analysis framework developed on top of Soot.

swIMP (swig-based Interfaces for Mathematical Programming) provides Java wrappers for solvers written in C or C++. The current focus is on accessing OSI-compatible linear programming (LP) solvers from the Coin-OR-project (e.g. Clp, GLPK, MOSEK, CPLEX).

Project consists in a software that reads a copied web site to your computer and generates a graph model of it. The model is based on the links, which are seen as the edges, and the pages, which are the vertices of the graph.

EZvolve Foundation Classes is a set of data types and utility classes for use with evolutionary algorithms. Currently implemented support for bit string encoding, populations, fitnesses, fitness functions, probabilities, and probability vectors.

X-GAT (XML-based Genetic Algorithm Toolkit) is a Java framework to optimize problems with Genetic Algorithms (GAs). Differently from other frameworks, X-GAT contains ready-to-use GAs implementations and new features can be easily added.

An information extraction library implementing modern algorithms for the extraction of named entities from text.

Programmieraufgabe 10 der Vorlesung Computerorientierte Mathematik I WS10/11 an der tu-Berlin.

Sleepwalker aims to provide a highly abstract, universal, reusable, extensible Java-based genetic algorithms framework which can be used as a basis for modelling and programming virtually any practical optimisation problem.

Awakener aims to provide a Java library for solving practical, real world optimisation problems by means of genetic algorithms (turnkey algorithms for >= 90% of industry problems). Awakener extends Sleepwalker with specific algorithms.