Open Source Java Algorithms - Page 7

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.

This is a cross-platform framework for using Genetic Algorithms for solutions. Written in Java and uses convinient plug-in features for every phase in the genetic development, while maintaining an easy-to-use API for easy integration into applications.

This API is intended to help developers use genetic algorithms in their own java applications. GeneticLibrary.zip contains the netbeans project of the API itself. GeneticTrial.zip contains another netbeans project which is an example explaining how to use the API. docs.zip is the documentation of the API. Please take a look there, it is really helpful. I have only two request from who will use this API; USE, UPDATE AND MODIFY IT FREELY JUST NOTE THE ORIGINAL AUTHOR

Genetic Programming (tree structure) predictor within Weka data mining software for both continuous and classification problems.

The Distributed Genetic Programming Framework is a scalable Java genetic programming environment. It comes with an optional specialization for evolving assembler-syntax algorithms. The evolution can be performed in parallel in any computer network.

This project aims to test Distributed Artifitial Intelligence in a urban traffic light control. GlobalSyncLocal is used to interact with the SUMO simulator through the TraSMAPI.

GraphScript project is a network theory simulator based purely on Java and Java scripting engines. It is intended to allow fast development, testing and visualization of network theory (graph) algorithms.

This project aims to provide developers a convenient library about graph theory algorithm and some basic data structures. It will be developed in Java via Eclipse IDE, supporting both win32 and linux systems, and published as jar files.

A Java library and set of tools to quickly and easily manipulate graphs (set of nodes and edges) and dynamic graphs. The principal trait of this library is its ability to manage (create, edit, layout, display) continuously evolving graphs. The development of this project now takes place on Github. Visit the official Graphstream website at http://graphstream-project.org

HL7 to XML Transformation toolkit. Using HL7 v2 XML

This is a framework used to decompose hierarchical graphs, i.e.,graphs which were created from or contain a hierarchy of modules. Each module is reused several times in the hierarchy. This may be useful to reverse-engineer human constructs like electronic equipment, manufactured machines, or bureaucratic hierarchies; but also to decompose natural constructs like gene-relation or protein-relation nets.

Open Source IM and voice client using Jabber and SIP protocols, with great audio quality thanks to speex and a nice and clean interface. Programmed in Java and C++. It supports chat, voice and file transfers.

An heuristic image stitcher made to test Genetic and PSO based algorithms

A collection of Concurrent and Highly Scalable Utilities. These are intended as direct replacements for the java.util.* or java.util.concurrent.* collections but with better performance when many CPUs are using the collection concurrently.

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.

A histogram library for Java that accepts large datasets with any distribution or range with a very small memory footprint, needs no pre- or post-processing, and provides several statistical functions.

Das Horner-Schema ist ein schnelles und einfaches Verfahren, um einen Funktionswert von Polynomen an einem gegeben Wert zu berechnen. Dieses Projekt beinhält eine Facharbeit und Programmierbeispiele in Pascal und Java zum Thema.

Information Dispersal Algorithym (IDA) is a method to split a file f into n pieces in such a way that the file can be reconstructed from some predefined subsets of pieces. this is a Java implementation.

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.

A multi staged approach to the examination timetabling problem as described in the second International timetabling competition (ITC2007-2008)

The Idealize Recommendation Framework supports the development of recommender systems. We have devised a set of requirements all recommender systems must address, an architecture for those requirements, a technical vocabulary and a production model.

Validator e uma API para auxiliar na validação de dados.

Java generic API for search algorithms on graphs implicitly given by tree node expansion operator

Most comprehensive list of tech interview questions of companies scraped from Geeksforgeeks, CareerCup and Glassdoor.