Search Results for "java swing projects" - Page 6

Very fast and easy to use Java tool for solving and generating Sudoku puzzles. By using Donald Knuths exact cover algorithmus it can not only solve or create the usual 9x9 but also 4x4, 16x16 or even bigger Sudokus in a very efficient way.

JOthi is the java-based game of "Othello". This project is son of the greater parent SourceForge project "JGames", that realizes the real game environment: JOthi only defines the "Othello" game rules and its specific AI players.

Emergent Mercenary is a 3D FPS with strategy overtones, and an excerise in emergent gaming. It should be easy to setup a scenario (e.g. hunt criminal) just by placing characters with certain AI into the game and see them interact.

MAIF is developed in Java 5 (especially Generics) and aims at building AI algorithms, by concentrating onto the mapping of real-world problems, while abstracting from their inner working. It can be extended with new algorithms and problem representations.

YABI93 is an Interpreter for the esoteric programming language Befunge, version "Befunge93". It is written in Java 1.5 and uses Swing for its graphical interface. YABI supports a multilanguage GUI.

Formicidae is the official simulator and visualizer for the Ant-Wars competitive programming site, written in Java and SISC. The site is hosted at www.ant-wars.net.

Mr. Logister is a resource scheduling application that uses genetic algorithms to find the best utilization and allocation of resources. The scheduler understands hard constraints like free/busy time and soft constraints like suitability and preferences.

Genetic Algorithm implementation.

neochip is a collection of algorithms for high-density oligonucleotide microarrays. The current version contains heuristic algorithms that attempt to improve the quality of arrays by re-designing their layout (the location of the probes on the chip).

brCluster is a class library, written in java, that implements generic clustering algorithms carefully designed to allow its aplication in any kind of data. The algorithms implemented are K-means and Hierarchical Clustering (Simple and Complete Link).

The Parameter Tuning Unity (PTU) aims to adapt the parameters of ever connected multi-agents system, or expert system with a plugged optimization heuristic likes the descent of gradient for instance.

NeoBio is a Java class library of Computational Biology Algorithms. The current version consists mainly of pairwise sequence alignment algorithms such as the classical dynamic programming methods of Needleman-Wunsch and Smith-Waterman.

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.

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.

a sandbox for trying my engine ideas

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.

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.

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.

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.

DOCUMENTACIÓN A PRESENTAR. 1. Memoria preliminar describiendo la tecnología a utilizar y su justificación, planificación de las tareas a realizar y distribución de dichas tareas entre los miembros del grupo. 2. Ejecutable que cumpla los requisitos establecidos en la memoria. 3. Memoria final del proyecto, en el que se incluirá: a. Descripción de la tecnología utilizada y, en el caso de que no coincida con la establecida en la memoria preliminar, justificar el cambio. b....

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

Provide geneology information, contact information, personal descriptions and webpages, calendars, etc in a web interface. This system will use php and any database system and will provide various level of public and private access.

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.