Open Source Java Algorithms - Page 15

Provides a framework to allow multiple components of a program communicate through a singular interface.

The Simple RTF Writer (SRW) is a slim Java library which empower Java programms to create RTF ("Rich Text Format" - an alternative document format from Microsoft) documents and fill bookmarks and fields in existing RTF documents on any platforms.

Sinalgo is a simulation framework for testing and validating network algorithms. It allows for quick prototyping and verification in freely customizable network settings. It is mainly suited for packet-oriented wireless networks.

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.

Design and develop Recommendation and Adaptive Prediction Engines to address eCommerce opportunities. Build a portfolio of engines by creating and porting algorithms from multiple disciplines to a usable form. Try to solve NetFlix and other challenges.

Sounder is a spell checker that allows user to enter a word as they think it should sound not as they think it is spelled. A list of similar sounding words is returned to the user with the correct spelling.

The Spiffy framework is a collection of often used helper methods and utility classes used in industry. Such methods and classes solves existing and re-ocuring practical problems and remedies annoying features of the Java language.

The project objective is the development of an optimization algorithm for the problem of stowing general cargo into platform supply vessels.

StrMatch is a simple java program, created for educational purposes, that allows user to test a great part of string matching algorithms. An intuitive user interface shows each algorithm step accurately...

Project that will provide implementations in Java's Micro Edition (J2ME) platform of algorithms on strings, for exact/inexact matching, similarity distances, among others.

Provides fast lookup for a Subject Based messaging product using a trie. It allows for configurable wildcard characters to replace a single or multiple subject field(s) (A.B.*.D.>). Insertion in to the tree returns a unique handle for subsequent deletion

This simplesudodu program is intend for studying in the sudoku solution algorithm rather than a game (If you want to make it a game, it's OK ^_^). Later I will implement the 4*4 or other kinds. Different sudoku requires different algorithm to solve.

A Java API for using suffix trees with natural language and an Eclipse/SWT-based GUI for suffix tree visualization using Graphviz.

Java generic Iterator implementation to generate permutations and combinations. Uses the algorithm described here http://en.wikipedia.org/wiki/Steinhaus%E2%80%93Johnson%E2%80%93Trotter_algorithm#Even.27s_speedup and the clear description of that algorithm here: http://www.cut-the-knot.org/Curriculum/Combinatorics/JohnsonTrotter.shtml

SweenJet helps developers to create Java applications. It provides constrained models, useful Swing components (e.g. splash screen, input fields), actions, look-and-feel enhancements (e.g. themes, multi-line tooltip), and a complete preferences system. This project is no longer actively developed.

Centre is a synthetic trajectory generator environment that aim to generate semantic-based trajectory datasets usable for spatio-temporal data-mining algorithms in testing and validation process.

This project is intended to provide Git access to the code of the original project, TA-Lib, which uses Subversion. It is intended for system integrators wishing to use TA-Lib in their Git-managed project through Git submodules or subtrees. No actual development is being done here; all development happens in the original project.

Teeser is a java-based integration framework for engineering emergent self-organizing behavior in distributed systems. It contains tools for analysis, tuning, macroscopic probing and simulations of distributed systems. Library of tools can be extended and everybody is encouraged to provide and share its tools with the community. The main idea is to provide application designers ability to seamlessly use tools which are helpful to design self-organizing behavior. Designers can continue to use their domain tools such as favorable simulator and by pluging it into the framework can take advantage of distributed simulations in the grid, various analyzers, optimizers (particle swarm optimization, genetic algorithms, ...). See Wiki pages for more information.

Takthons provides container and manipulation services for evolved machine language routines. This allows the calling application to concentrate on the UI, the fitness evaluation and the genetic operations rather than the machine language details.

Taseree has been renamed to Drools Planner and moved to JBoss.org, see http://www.jboss.org/drools/drools-planner

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. Descripción de los costes computacionales y requisitos tecnológicos. c. Manual de usuario del programa desarrollado. FASES 1. Entrega de la memoria preliminar (límite: 24 de febrero) (1 punto). 2. Entrega del ejecutable (4 puntos) y de la memoria final (3 puntos) (límite: 23 de mayo). 3. Presentación del trabajo (2 puntos) (28 de mayo).

Ky eshte nje projekt i HAPUR/FALAS per publikun Shqip-foles i cili permban nje seri Video-Kursesh, Udhezime, dhe Shembuj Kodi per gjuhe (web) si: XHTML, CSS, JS, PHP, AS3 etj. si dhe per Desktop: C++, Java, Adobe Air etj. + programe/praktika te ndryshme.

Fills a rectangle using given tetris shapes (tetraminos) using an optimized brute force algorithm. A puzzle can have many different solutions; this solver will stop at the first one. Not all puzzles are solveable. Created to solve the annoying tetris puzzles in The Talos Principle and Sigils of Elohim.

This project has moved. Please follow the WWW link below.

A framework for utilising the Genetic Algorithm in the domain of Game Theory