Open Source Java Algorithms - Page 16

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.

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

HOOPLE is a portable collection of C++ source code, featuring thread-safe objects for collections and event processing, RPC-style plugin-based encrypted networking (CROMP / octopus), bookmark collection management utilities, and a lot of other cool stuff. This is the project page for HOOPLE version 1, which was retired on September 25 2010. The code supposedly still builds on both Linux (with gnu gcc) and on Windows (with ms visual studio). Most of the code from hoople1 has moved into the Feisty Meow® Concerns Ltd codebase, available at http://feistymeow.org for your enjoyment.

The Watermarks is a java library for images and text watermarking fingerprinting and tamper-proofing. The supported carrier formats for a watermark are JPEG and PDF. The project also aim to build a test environment to evaluate robustness of implemented a

The treexpr library is a Free Software library that applies regular expression concepts to tree structures. It it written in C and has a JNI binding to Java.

Theba is a plugin-based image analysis framework for segmentation of and measurements on 3D and 2D images. Theba has a nice GUI that allows inspection and manipulation of the image and a wide range of plugins including segmentation.

The target of this project is to build easy, reliable, flexible and universal Java Configuration Tool.

Java Framework for automatic transformation of graph structured Process Models (incl. BPMN import) to block structured BPEL code. A graphical tool is provided for visualisation and testing.

Este projeto objetiva a criação de um Toolbox para utilização de algoritmos de Computação Bioinspirada. O Toobox oferece uma vasta coleção de algoritmos de ferramentas para o projeto de Algoritmos Genéticos e Redes Neurais.

Efficiently create compact, highly customizable tree layouts - Based on Walker's algorithm with enhancements suggested by Buchheim, Jünger, and Leipert the software builds tree layouts in linear time. I.e. even trees with many nodes are built fast. Downloads are available at https://sourceforge.net/projects/treelayout/files/. For detailed documentation look at the TreeLayout web site http://treelayout.sourceforge.net/. Development for TreeLayout has moved to https://github.com/abego/treelayout/.

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.

This project's goal is to implement Artificial Inteligence algorithms and make them available for any platform but especially for mobile devices. The main objective is to allow the community to develop better and more inteligent mobile games.

Reimplementation of the anomaly detection/one-class classification algorithm 'V-detector'.

VR Hanoi Towers - Java Application - v.1.0 java sources included (*) look in the "Files" section also demonstrates the use of threads and mouse drag & drop operations please, let me know what you think about this project adrixnt@hotmail.it skype: adrixnt

VisualSort is a Java application for visualizing the way different sort algorithms work. Its implementation makes it easy to add new sort algorithms.

API Java de visualisation et d'interaction dans le domaine des graphes.

The Vodoo/Stream project let users to define transducers dedicated to document analysis. Such transducers describe how fragments are matched and transformed. Finally a document can be an XML fragment, a free text or something else depending on extensions

**NOTE**: The WALA project is now hosted at https://github.com/wala/WALA; the latest source code and updates are available there. The code here on Sourceforge is highly out of date and unsupported. The T. J. Watson Libraries for Analysis (WALA) provide program analysis capabilities for Java bytecode and related languages. The WALA libraries constitute an open-source release of parts of IBM Research's DOMO analysis infrastructure.

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.

KNN-WEKA provides a implementation of the K-nearest neighbour algorithm for Weka. Weka is a collection of machine learning algorithms for data mining tasks. For more information on Weka, see http://www.cs.waikato.ac.nz/ml/weka/.

This is a GUI application for learning non disjoint groups based on Weka machine learning framework. It offers a variety of learning methods, based on k-means, able to produce overlapping clusters. The application also contains an evaluation framework that calculates several external validation measures. The application offers a visualization tool to discover overlapping groups.

This application talks to a GPS device over the NMEA protocol via the WIGSGPSComm API. The first version of the WIGS application will present the GPS data in an intuitive fashion, and later releases will be further enhanced with special map support.

WiFi Direct File Transfer is a experimental app that will allow sharing of data between Android devices running Android 4.0 or higher using a WiFi direct connection without the use of a WiFi access point. This will enable data transfer between devices without relying on any existing network infrastructure

Extract a Term Concept Map from Wikipedia. It takes an export of the Wikipedia and imports it into a database. The extracted term concept map can then serve as a basis for semantically enhancing applications, with the depth and bredth of the Wikipedia.