Search Results for "algorithm" - Page 7

gSemSearch is a tool searching for relation among entities in graph or network structure. It exploits spread of activation algorithm and user interaction with graph data. Posible applications are: Email Search (see http://ikt.ui.sav.sk/esns/) or BI

Java Chaotic Random Number Generator - Inspired by chaos theory, the intent of this generator is to produce unseeded, unpredictable numbers. The numbers will not follow a predictable sequence and will not rely on a pseudorandom algorithm.

An encryption algorithm and UI frontend written in Java.

A java command-line application where the main goal is to solve any simplex problem. It's a team-work school project. It can be usefull for other students who needs to understand the simplex algorithm.

Yet another MAZE! There is going to be maze generation algorithm(s) and pathfinders who use certain algorithms to solve the maze. This project was initially a student team project at Thompson Rivers University(TRU) to demonstrate search algorithms.

... algorithm, which lets the content place itself where it is needed. It is robust, scalable and adaptive. The transport path of content is exploited to replicate content and limited storage space is handled by clean-up mechanisms. We implemented a simulator to show the algorithm's performance and to test its behavior under real circumstances. It is easily extendable to support several new scenarios or changes to the algorithm (see replication and client models).

DEAL (Domain Extraction ALgorithm) is an application for domain analysis. Its main purpose is to extract domain information from existing Java applications and to create different kinds of models from the extracted data, including domain-specific languages.

JLyap calculates and displays image maps of the lyapunov exponents of functions. It supports smart algorithm for fast calculation of lyapunov exponent, pane selection by mouse clicking within image (no limition for aspect ratios or angles), Open/save fun

A project originally for an undergraduate Freshman seminar on motion planning algorithms. Provides a basic interface for drawing obstacles in a 2-D plane and the ability to select an algorithm by which to plan a path in this user-defined world.